Abstract
A graph G is called a block graph if every maximal 2-connected component of G is a clique. In this paper we study the Block Graph Vertex Deletion from the perspective of fixed parameter tractable (FPT) and kernelization algorithms. In particular, an input to Block Graph Vertex Deletion consists of a graph G and a positive integer k, and the objective to check whether there exists a subset \(S \subseteq V(G)\) of size at most k such that the graph induced on \(V(G) \setminus S\) is a block graph. In this paper we give an FPT algorithm with running time \(4^kn^{\mathcal {O}(1)}\) and a polynomial kernel of size \(\mathcal {O}(k^4)\) for Block Graph Vertex Deletion. The running time of our FPT algorithm improves over the previous best algorithm for the problem that runs in time \(10^kn^{\mathcal {O}(1)}\), and the size of our kernel reduces over the previously known kernel of size \(\mathcal {O}(k^6)\). Our results are based on a novel connection between Block Graph Vertex Deletion and the classical Feedback Vertex Set problem in graphs without induced \(C_4\) and \(K_4-e\). To achieve our results we also obtain an algorithm for Weighted Feedback Vertex Set running in time \(3.618^kn^{\mathcal {O}(1)}\) and improving over the running time of previously known algorithm with running time \(5^kn^{\mathcal {O}(1)}\).
The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007–2013) / ERC grant agreement no. 306992.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discret. Math. 12(3), 289–297 (1999)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)
Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7), 1188–1198 (2008)
Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Switzerland (2015)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, New York (2006)
Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S., F-deletion, P.: Approximation, kernelization and optimal FPT algorithms. In: FOCS (2012)
Fujito, T.: A unified approximation algorithm for node-deletion problems. Discrete Appl. Math. 86, 213–231 (1998)
Howorka, E.: A characterization of ptolemaic graphs. J. Graph Theor. 5(3), 323–331 (1981)
Kim, E.J., Kwon, O.: A polynomial kernel for block graph vertex deletion. CoRR, abs/1506.08477 (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)
Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41, 960–981 (1994)
Marx, D., O’Sullivan, B., Razgon, I.: Finding small separators in linear time via treewidth reduction. ACM Trans. Algorithms 9(4), 30 (2013)
Thomassé, S.: A \(4k^2\) kernel for feedback vertex set. ACM Trans. Algorithms 6(2), 32: 1–32: 8 (2010)
Tong, P., Lawler, E.L., Vazirani, V.V.: Solving the weighted parity problem for gammoids by reduction to graphic matching. Technical report UCB/CSD-82-103, EECS Department, University of California, Berkeley, April 1982
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrawal, A., Kolay, S., Lokshtanov, D., Saurabh, S. (2016). A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion . In: Kranakis, E., Navarro, G., Chávez, E. (eds) LATIN 2016: Theoretical Informatics. LATIN 2016. Lecture Notes in Computer Science(), vol 9644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49529-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-49529-2_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49528-5
Online ISBN: 978-3-662-49529-2
eBook Packages: Computer ScienceComputer Science (R0)