Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Chen, J., Fomin, F. V., Liu, Y., Lu, S., & Villanger, Y. (2007). Improved algorithms for the feedback vertex set problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4619 LNCS, pp. 422–433). Springer Verlag. https://doi.org/10.1007/978-3-540-73951-7_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
