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.

• Type: Conference
• Year: 2007
• Where: WADS
• Authors: Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songjian Lu, Yngve Villanger
• Keywords: Algorithms, Feedback Vertex Set, Parameterized Algorithms, Vertex Set Problem, WADS 2007