Article ID Journal Published Year Pages File Type
418973 Discrete Applied Mathematics 2008 12 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Feedback vertex set on AT-free graphs
Authors
, , ,