Feedback vertex set on AT-free graphs
Discrete Applied Mathematics (2008)
Available from Discrete Applied Mathematics
or
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.
Author-supplied keywords
Readership Statistics
3 Readers on Mendeley
by Discipline
by Academic Status
33% Ph.D. Student
33% Researcher (at an Academic Institution)
33% Assistant Professor
by Country
33% Brazil
33% United States
33% France
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
