Abstract
Feedback Vertex Set (FVS) is one of the most well studied problems in the realm of parameterized complexity. In this problem we are given a graph G and a positive integer k and the objective is to test whether there exists \(S\subseteq V(G)\) of size at most k such that \(G-S\) is a forest. Thus, FVS is about deleting as few vertices as possible to get a forest. The main goal of this paper is to study the following interesting problem: How can we generalize the family of forests such that the nice structural properties of forests and the interesting algorithmic properties of FVS can be extended to problems on this class? Towards this we define a graph class, \(\mathcal{F}_l\), that contains all graphs where each connected component can transformed into forest by deleting at most l edges. The class \(\mathcal{F}_1\) is known as pseudoforest in the literature and we call \(\mathcal{F}_l\) as l-pseudoforest. We study the problem of deleting k-vertices to get into \(\mathcal{F}_l\), \(l\)-pseudoforest Deletion, in the realm of parameterized complexity. We show that \(l\)-pseudoforest Deletion admits an algorithm with running time \(c_l^k n^{{\mathcal {O}}(1)}\) and admits a kernel of size \(f(l)k^2\). Thus, for every fixed l we have a kernel of size \({\mathcal {O}}(k^2)\). That is, we get a uniform polynomial kernel for \(l\)-pseudoforest Deletion. For the special case of \(l=1\), we design an algorithm with running time \(7.5618^k n^{{\mathcal {O}}(1)}\). Our algorithms and uniform kernels combine iterative compression, expansion lemma and protrusion machinery.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: FOCS, pp. 150–159 (2011)
Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)
Fomin, F.V., Lokshtanov, D., Misra, N., Philip, G., Saurabh, S.: Hitting forbidden minors: approximation and kernelization. In: STACS, pp. 189–200 (2011)
Fomin, F.V., Lokshtanov, D., Misra, N., Ramanujan, M.S., Saurabh, S.: Solving d-sat via backdoors to small treewidth. In: SODA, pp. 630–641 (2015)
Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar F-deletion: approximation, kernelization and optimal FPT algorithms. In: FOCS (2012)
Gallai, T.: Maximum-minimum stze und verallgemeinerte faktoren von graphen. Acta Mathematica Academiae Scientiarum Hungarica 12(1–2), 131–173 (1964)
Giannopoulou, A.C., Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: Uniformkernelization complexity of hitting forbidden minors. CoRR, abs/1502.03965 (2015). to appear in ICALP 2015
Kociumaka, T., Pilipczuk, M.: Faster deterministic feedback vertex set. Inf. Process. Lett. 114(10), 556–560 (2014)
Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219–230 (1980)
Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford (2006)
Rai, A., Saurabh, S.: Bivariate complexity analysis of almost forest deletion. In: COCOON (2015) (to appear)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Philip, G., Rai, A., Saurabh, S. (2015). Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. In: Italiano, G., Pighizzini, G., Sannella, D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science(), vol 9235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48054-0_43
Download citation
DOI: https://doi.org/10.1007/978-3-662-48054-0_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48053-3
Online ISBN: 978-3-662-48054-0
eBook Packages: Computer ScienceComputer Science (R0)