Abstract
It is shown, that for each constant k ≥ 1, the following problems can be solved in O(n) time: given a graph G, determine whether G has k vertex disjoint cycles, determine whether G has k edge disjoint cycles, determine whether G has a feedback vertex set of size ≤ k. Also, every class G, that is closed under minor taking, or that is closed under immersion taking, and that does not contain the graph formed by taking the disjoint union of k copies of K3, has an O(n) membership test algorithm.
Cite
CITATION STYLE
Bodlaender, H. L. (1992). On disjoint cycles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 570 LNCS, pp. 230–238). Springer Verlag. https://doi.org/10.1007/3-540-55121-2_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
