Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

DAM
2008

favoriteEmaildiscussreport

108views more DAM 2008»

Feedback vertex set on AT-free graphs

13 years 4 months ago

Feedback vertex set on AT-free graphs

Download lita.sciences.univ-metz.fr

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

Dieter Kratsch, Haiko Müller, Ioan Todinca

Real-time Traffic

Asteroidal Triple-free Graph | DAM 2008 | Feedback Vertex | Polynomial Time Algorithm |

claim paper

Related Content

» Directed Feedback Vertex Set Problem is FPT

» Improved Algorithms for the Feedback Vertex Set Problems

» Isomorphism for Graphs of Bounded Feedback Vertex Set Number

» A Cubic Kernel for Feedback Vertex Set

» Feedback Vertex Set on Graphs of Low Cliquewidth

» A primaldual interpretation of two 2approximation algorithms for the feedback vertex set p...

» Solving the feedback vertex set problem on undirected graphs

» Querying Graphs in ProteinProtein Interactions Networks Using Feedback Vertex Set

» A Minimum Feedback Vertex Set in the Trivalent Cayley Graph

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Dieter Kratsch, Haiko Müller, Ioan Todinca

Comments (0)