Abstract
In vertex deletion problems on graphs, the task is to find a set of minimum number of vertices whose deletion results in a graph with some specific property. The class of vertex deletion problems contains several classical optimization problems, and has been studied extensively in algorithm design. Recently, there was a study on vertex deletion problems on split graphs. One of the results shown was that transforming a split graph into a block graph and a threshold graph using minimum number of vertex deletions is NP-hard. We call the decision version of these problems as Split to Block Vertex Deletion (SBVD) and Split to Threshold Vertex Deletion (STVD), respectively. In this paper, we study these problems in the realm of parameterized complexity with respect to the number of vertex deletions k as parameter. These problems are “implicit” 4-Hitting Set, and thus admit an algorithm with running time \(\mathcal{O}^\star (3.0755^k)\), a kernel with \(\mathcal{O}(k^3)\) vertices, and a 4-approximation algorithm. In this paper, we exploit the structure of the input graph to obtain a kernel for SBVD with \(\mathcal{O}(k^2)\) vertices and FPT algorithms for SBVD and STVD with running times \({\mathcal O^\star }(2.3028^k)\) and \({\mathcal O^\star }(2.7913^k)\).
We thank Saket Saurabh for his invaluable advice and several helpful suggestions.
P. Jain— Supported by SERB-NPDF fellowship (PDF/2016/003508) of DST, India.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A chordal graph is a graph in which every induced (or chordless) cycle is a triangle.
- 2.
\(\mathcal {O}^\star \) notation suppresses polynomial factors. That is, \(\mathcal {O}^\star (f(k))=\mathcal {O}(f(k)n^{\mathcal {O}(1)})\).
- 3.
Proofs of results marked with \(\circledast \) will be given in full version of the paper.
References
Agrawal, A., Kolay, S., Lokshtanov, D., Saurabh, S.: A faster FPT algorithm and a smaller kernel for Block Graph Vertex Deletion. In: Kranakis, E., Navarro, G., Chávez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 1–13. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49529-2_1
Bandelt, H., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182–208 (1986)
Bonomo, F., Durán, G., Valencia-Pabon, M.: Complexity of the cluster deletion problem on subclasses of chordal graphs. Theor. Comput. Sci 600, 59–69 (2015)
Cao, Y., Ke, Y., Otachi, Y., You, J.: Vertex deletion problems on chordal graphs. In: Proceedings of FSTTCS, pp. 22:1–22:14 (2017)
Chandran, L.S., Rajendraprasad, D., Tesar, M.: Rainbow colouring of split graphs. Discrete Appl. Math. 216, 98–113 (2017)
Cygan, M., Pilipczuk, M.: Split vertex deletion meets vertex cover: new fixed-parameter and exact exponential-time algorithms. Inf. Process. Lett. 113(5), 179–182 (2013)
Diestel, R.: Graph Theory. Springer, Berlin (2005)
Drange, P.G., Dregi, M.S., Lokshtanov, D., Sullivan, B.D.: On the threshold of intractability. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 411–423. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48350-3_35
Fomin, F.V., Gaspers, S., Kratsch, D., Liedloff, M., Saurabh, S.: Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7), 1045–1053 (2010)
Fomin, F.V., Gaspers, S., Lokshtanov, D., Saurabh, S.: Exact algorithms via monotone local search. In: Proceedings of STOC, pp. 764–775. ACM (2016)
Ghosh, E., et al.: Faster parameterized algorithms for deletion to split graphs. Algorithmica 71(4), 989–1006 (2015)
Golumbic, M.C.: Algorithmic graph theory and perfect graphs, 2nd edn. Elsevier Science B.V., Amsterdam (2004)
Heggernes, P., Lokshtanov, D., Mihai, R., Papadopoulos, C.: Cutwidth of split graphs and threshold graphs. SIAM J. Discrete Math. 25(3), 1418–1437 (2011)
Hochbaum, D.S.: Approximation Algorithms for NP-hard Problems. PWS Publishing Co., Boston (1997)
Illuri, M., Renjith, P., Sadagopan, N.: Complexity of steiner tree in split graphs - dichotomy results. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 308–325. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-29221-2_27
Kim, E.J., Kwon, O.: A polynomial kernel for block graph deletion. Algorithmica 79(1), 251–270 (2017)
Le, T., Lokshtanov, D., Saurabh, S., Thomassé, S., Zehavi, M.: Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. In: Proceedings of SODA, pp. 331–342 (2018)
Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219–230 (1980)
Moser, H.: Finding optimal solutions for covering and matching problems. Ph.D. thesis, Institut für Informatik, Friedrich-Schiller Universitüt Jena (2009)
Saurabh, S.: Personal Communication (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Choudhary, P., Jain, P., Krithika, R., Sahlot, V. (2019). Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. In: Heggernes, P. (eds) Algorithms and Complexity. CIAC 2019. Lecture Notes in Computer Science(), vol 11485. Springer, Cham. https://doi.org/10.1007/978-3-030-17402-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-17402-6_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-17401-9
Online ISBN: 978-3-030-17402-6
eBook Packages: Computer ScienceComputer Science (R0)