Sciweavers

Share
WADS
2005
Springer

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

9 years 7 months ago
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NPcomplete Edge Bipartization problem with runtime O(2k · m2 ).
Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Nie
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where WADS
Authors Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
Comments (0)
books