Improved algorithms for feedback vertex set problems

@article{Chen2007ImprovedAF,
  title={Improved algorithms for feedback vertex set problems},
  author={J. Chen and F. Fomin and Yang Liu and Songjian Lu and Yngve Villanger},
  journal={J. Comput. Syst. Sci.},
  year={2007},
  volume={74},
  pages={1188-1198}
}
  • J. Chen, F. Fomin, +2 authors Yngve Villanger
  • Published 2007
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kkn2). 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. 
    96 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    An improved parameterized algorithm for the independent feedback vertex set problem
    • Y. Song
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2014
    • 13
    • PDF
    Feedback Vertex Set in Mixed Graphs
    • 16
    • Highly Influenced
    • PDF
    Directed Feedback Vertex Set Problem is FPT
    • J. Chen, Yang Liu, Songjian Lu
    • Mathematics, Computer Science
    • Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs
    • 2007
    • 10
    • PDF
    Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
    • 10
    • PDF
    A Linear Kernel for Planar Feedback Vertex Set
    • 36
    FPT algorithms for generalized feedback vertex set problems
    • Bin Sheng
    • Computer Science, Mathematics
    • TAMC
    • 2020
    • PDF
    A fixed-parameter algorithm for the directed feedback vertex set problem
    • 98

    References

    SHOWING 1-10 OF 39 REFERENCES
    A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
    • 303
    • PDF
    An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
    • 83
    Finding a Minimum Feedback Vertex Set in Time O (1.7548n)
    • 45
    • PDF
    Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
    • 190
    • PDF
    An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
    • 106
    • Highly Influential
    An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
    • 62
    • PDF
    Exact Computation of Maximum Induced Forest
    • I. Razgon
    • Computer Science, Mathematics
    • SWAT
    • 2006
    • 69
    • PDF