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 条
  • [41] Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
    Koutsonas, Athanassios
    Thilikos, Dimitrios M.
    ALGORITHMICA, 2011, 60 (04) : 987 - 1003
  • [42] Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
    Koutsonas, Athanassios
    Thilikos, Dimitrios M.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2008, 5344 : 264 - 274
  • [43] Improved algorithms for weighted and unweighted set splitting problems
    Chen, Jianer
    Lu, Songjian
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2007, 4598 : 537 - +
  • [44] Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
    Bonnet, Edouard
    Brettell, Nick
    Kwon, O-joung
    Marx, Daniel
    ALGORITHMICA, 2019, 81 (10) : 3890 - 3935
  • [45] Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
    Édouard Bonnet
    Nick Brettell
    O-joung Kwon
    Dániel Marx
    Algorithmica, 2019, 81 : 3890 - 3935
  • [46] Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
    Gupta, Sushmita
    Modak, Sounak
    Saurabh, Saket
    Seetharaman, Sanjay
    LATIN 2024: THEORETICAL INFORMATICS, PT I, 2024, 14578 : 225 - 240
  • [47] Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference
    Bar-Yehuda, R
    Geiger, D
    Naor, J
    Roth, RM
    SIAM JOURNAL ON COMPUTING, 1998, 27 (04) : 942 - 959
  • [48] Faster deterministic FEEDBACK VERTEX SET
    Kociumaka, Tomasz
    Pilipczuk, Marcin
    INFORMATION PROCESSING LETTERS, 2014, 114 (10) : 556 - 560
  • [49] On Parameterized Independent Feedback Vertex Set
    Misra, Neeldhara
    Philip, Geevarghese
    Raman, Venkatesh
    Saurabh, Saket
    THEORETICAL COMPUTER SCIENCE, 2012, 461 : 65 - 75
  • [50] FEEDBACK VERTEX SET ON PLANAR GRAPHS
    Chen, Hong-Bin
    Fu, Hung-Lin
    Shih, Chie-Huai
    TAIWANESE JOURNAL OF MATHEMATICS, 2012, 16 (06): : 2077 - 2082