Sciweavers

Share
WADS
2007
Springer

Improved Algorithms for the Feedback Vertex Set Problems

9 years 7 months ago
Improved Algorithms for the Feedback Vertex Set Problems
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algorithms construct a feedback vertex set of size bounded by k (in the weighted case this set is of minimum weight among the feedback vertex set of size at most k) in a given graph G, or reports that no such a feedback vertex set exists in G.
Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songji
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where WADS
Authors Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songjian Lu, Yngve Villanger
Comments (0)
books