Sciweavers

1933 search results - page 5 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
195
Voted
FSTTCS
2009
Springer
16 years 1 months ago
Kernels for Feedback Arc Set In Tournaments
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
Stéphane Bessy, Fedor V. Fomin, Serge Gaspe...
DAM
2008
108views more  DAM 2008»
15 years 6 months ago
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 ...
Dieter Kratsch, Haiko Müller, Ioan Todinca
WALCOM
2010
IEEE
238views Algorithms» more  WALCOM 2010»
16 years 1 months ago
FPT Algorithms for Connected Feedback Vertex Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
IWPEC
2004
Springer
16 years 3 days ago
Parameterized Algorithms for Feedback Vertex Set
Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefe...
121
Voted
JCSS
2006
35views more  JCSS 2006»
15 years 6 months ago
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Nie...