Improved algorithms for feedback vertex set problems

@article{Chen2008ImprovedAF,
  title={Improved algorithms for feedback vertex set problems},
  author={J. Chen and F. Fomin and Yang Liu and Songjian Lu and Yngve Villanger},
  journal={Journal of Computer and System Sciences},
  year={2008},
  volume={74},
  pages={1188-1198}
}
  • J. Chen, F. Fomin, +2 authors Yngve Villanger
  • Published 2008
  • Mathematics
  • Journal of Computer and System Sciences
  • We present improved parameterized algorithms for the feedback vertex set problem on both unweighted and weighted graphs. Both algorithms run in time O(5^kkn^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. 
    108 Citations
    Improved algorithms for feedback vertex set problems
    • 96
    • PDF
    An FPT Algorithm for Tree Deletion Set
    • 6
    An improved parameterized algorithm for the independent feedback vertex set problem
    • Y. Song
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2014
    • 13
    • Highly Influenced
    • PDF
    Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
    • 10
    • PDF
    Two Hardness Results on Feedback Vertex Sets
    • 27
    Enumerating Minimal Subset Feedback Vertex Sets
    • 29
    • PDF
    Enumerating Minimal Subset Feedback Vertex Sets
    • 14
    An Improved Exact Algorithm for Undirected Feedback Vertex Set
    • 8
    A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
    • 3

    References

    SHOWING 1-10 OF 25 REFERENCES
    Improved algorithms for feedback vertex set problems
    • 96
    • PDF
    A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
    • 303
    • PDF
    Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
    • 57
    • PDF
    An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
    • 83
    On Disjoint Cycles
    • H. Bodlaender
    • Mathematics, Computer Science
    • Int. J. Found. Comput. Sci.
    • 1994
    • 32
    An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
    • 106
    Finding a Minimum Feedback Vertex Set in Time O (1.7548n)
    • 45
    • PDF
    Exact Computation of Maximum Induced Forest
    • I. Razgon
    • Computer Science, Mathematics
    • SWAT
    • 2006
    • 69
    • PDF
    Finding odd cycle transversals
    • 352