Improved algorithms for feedback vertex set problems

被引:84
|
作者
Chen, Jianer [2 ]
Fomin, Fedor V. [1 ]
Liu, Yang [2 ]
Lu, Songjian [2 ]
Villanger, Yngve [1 ]
机构
[1] Univ Bergen, Dept Informat, N-5020 Bergen, Norway
[2] Texas A&M Univ, Dept Comp Sci, College Stn, TX 77843 USA
基金
美国国家科学基金会;
关键词
Parameterized complexity; Feedback vertex set;
D O I
10.1016/j.jcss.2008.05.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We present improved parameterized algorithms for the FEEDBACK VERTEX SET problem on both unweighted and weighted graphs. Both algorithms run in time O(5(k)kn(2)). The algorithms construct a feedback vertex set of size at most k (in the weighted case this set is of minimum weight among the feedback vertex sets of size at most k) in a given graph G of n vertices, or report that no such feedback vertex set exists in G. (C) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码:1188 / 1198
页数:11
相关论文
共 50 条