Abstract
We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the view-point of parameterized algorithms. CFVS is the connected variant of the classical Feedback Vertex Set problem and is defined as follows: given a graph G=(V,E) and an integer k, decide whether there exists F⊆V, |F|≤k, such that G[V∖F] is a forest and G[F] is connected.
We show that Connected Feedback Vertex Set can be solved in time O(2O(k) n O(1)) on general graphs and in time \(O(2^{O(\sqrt{k}\log k)}n^{O(1)})\) on graphs excluding a fixed graph H as a minor. Our result on general undirected graphs uses, as a subroutine, a parameterized algorithm for Group Steiner Tree, a well studied variant of Steiner Tree. We find the algorithm for Group Steiner Tree of independent interest and believe that it could be useful for obtaining parameterized algorithms for other connectivity problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bang-Jensen J, Gutin GZ (2009) Digraphs: theory, algorithms and applications, 2nd edn. Springer, Berlin
Bodlaender HL (1992) On disjoint cycles. In: Schmidt G, Berghammer R (eds) Proceedings on graph–theoretic concepts in computer science (WG ’91). LNCS, vol 570. Springer, Berlin, pp 230–238
Bodlaender HL (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J Comput 25(6):1305–1317
Bodlaender HL, Downey RG, Fellows MR, Hermelin D (2008) On problems without polynomial kernels (extended abstract). In: Proceedings of ICALP 2008, LNCS. Springer, Berlin, pp 563–574
Cao Y, Chen J, Liu Y (2010) On feedback vertex set: new measure and new structures. In: Kaplan H (ed) SWAT. Lecture notes in computer science, vol 6139. Springer, Berlin, pp 93–104
Dehne F, Fellows M, Langston MA, Rosamond F, Stevens K (2005) An O(2O(k) n 3) FPT-algorithm for the undirected feedback vertex set problem. In: Proceedings of COCOON 2005. LNCS, vol 3595. Springer, Berlin, pp 859–869
Demaine ED, Hajiaghayi M (2008) Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28(1):19–36
Demaine ED, Hajiaghayi M, Kawarabayashi K (2005) Algorithmic graph minor theory: decomposition, approximation, and coloring. In: Proceedings of FOCS 2005. IEEE Comput Soc, Los Alamitos, pp 637–646
Diestel R (2005) Graph theory, 3rd edn. Springer, Heidelberg
Ding B, Yu JX, Wang S, Qin L, Zhang X, Lin X (2007) Finding top-k min-cost connected trees in databases. In: ICDE. IEEE Press, New York, pp 836–845
Dom M, Lokshtanov D, Saurabh S (2009) Incompressibility through Colors and IDs. In: Proceedings of ICALP 2009. LNCS, vol 5555. Springer, Berlin, pp 378–389
Downey RG, Fellows MR (1999) Parameterized complexity. Springer, New York
Festa P, Pardalos PM, Resende MGC (1999) Feedback set problems. In: Handbook of combinatorial optimization. Kluwer Academic, Dordrecht, pp 209–258
Flum J, Grohe M (2006) Parameterized complexity theory. Texts in theoretical computer science. An EATCS series. Springer, Berlin
Fomin FV, Grandoni F, Kratsch D (2008) Solving connected dominating set faster than 2n. Algorithmica 52(2):153–166
Fomin FV, Lokshtanov D, Saurabh S, Thilikos DM (2010) Bidimensionality and kernels. In: Proceedings of the 21th ACM-SIAM symposium on discrete algorithms (SODA 2010). ACM/SIAM, New York/Philadelphia, pp 503–510
Grigoriev A, Sitters R (2009) Connected feedback vertex set in planar graphs. In: Graph-theoretic concepts in computer science, 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Lecture notes in computer science, vol 5911. Springer, Berlin, pp 143–153
Guo J, Gramm J, Hüffner F, Niedermeier R, Wernicke S (2006) Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J Comput Syst Sci 72(8):1386–1396
Hell P, Nešetřil J (2004) Graphs and homomorphisms. Oxford University Press, London
Mölle D, Richter S, Rossmanith P (2008) Enumerate and expand: improved algorithms for connected vertex cover and tree cover. Theory Comput Syst 43(2):234–253
Moser H (2005) Exact algorithms for generalizations of vertex cover. Master’s thesis, Institut für Informatik, Friedrich-Schiller-Universität
Nederlof J (2009) Fast polynomial-space algorithms using Möbius inversion: improving on Steiner tree and related problems. In: Proceedings of ICALP 2009, pp 713–725
Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford lecture series in mathematics and its applications, vol 31. Oxford University Press, Oxford
Thomassé S (2009) A quadratic kernel for feedback vertex set. In: Proceedings of SODA 2009. SIAM, Philadelphia, pp 115–119
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Misra, N., Philip, G., Raman, V. et al. FPT algorithms for Connected Feedback Vertex Set. J Comb Optim 24, 131–146 (2012). https://doi.org/10.1007/s10878-011-9394-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9394-2