Feedback vertex set on AT-free graphs

We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number. Key words: feedback vertex set, asteroidal triple-free graph

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Dieter Kratsch, Haiko Müller, Ioan Todinca
• Keywords: Asteroidal Triple-free Graph, DAM 2008, Feedback Vertex, Polynomial Time Algorithm