Feedback vertex set on AT-free graphs

Authors:
Dieter Kratsch;Haiko Müller;Ioan Todinca
Affiliations:
Laboratoire d'Informatique Théorique et Appliquée, Université de Metz, 57045 Metz Cedex 01, France;School of Computing, University of Leeds, Leeds LS2 9JT, UK;Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Université d'Orléans, BP 6759, 45067 Orléans Cedex 2, France
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 8
Cited 2

On domination problems for permutation and other graphs

Theoretical Computer Science
On the feedback vertex set problem in permutation graphs

Information Processing Letters
A linear-time algorithm for the weighted feedback vertex problem on interval graphs

Information Processing Letters
Asteroidal Triple-Free Graphs

SIAM Journal on Discrete Mathematics
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
Wavelength conversion in optical networks

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Independent Sets in Asteroidal Triple-Free Graphs

SIAM Journal on Discrete Mathematics

Colouring AT-Free graphs

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
An exact algorithm for subset feedback vertex set on chordal graphs

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation

Quantified Score

Hi-index	0.04

Visualization

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.