Document Open Access Logo

Quadratic Kernel for Cliques or Trees Vertex Deletion

Author Soh Kumabe

PDF

File

Thumbnail PDF
PDF
LIPIcs.ISAAC.2025.48.pdf
  • Filesize: 0.81 MB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Fixed parameter tractability
Keywords
  • Fixed-Parameter Tractability
  • Kernelization
  • Deletion to Scattered Graph Classes
  • Cluster Vertex Deletion
  • Feedback Vertex Set

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We consider Cliques or Trees Vertex Deletion, which is a hybrid of two fundamental parameterized problems: Cluster Vertex Deletion and Feedback Vertex Set. In this problem, we are given an undirected graph G and an integer k, and asked to find a vertex subset X of size at most k such that each connected component of G-X is either a clique or a tree. Jacob et al. (ISAAC, 2024) provided a kernel of O(k⁵) vertices for this problem, which was recently improved to O(k⁴) by Tsur (IPL, 2025). 
Our main result is a kernel of O(k²) vertices. This result closes the gap between the kernelization result for Feedback Vertex Set, which corresponds to the case where each connected component of G-X must be a tree. 
Although both cluster vertex deletion number and feedback vertex set number are well-studied structural parameters, little attention has been given to parameters that generalize both of them. In fact, the lowest common well-known generalization of them is clique-width, which is a highly general parameter. To fill the gap here, we initiate the study of the cliques or trees vertex deletion number as a structural parameter. We prove that Longest Cycle, which is a fundamental problem that does not admit o(n^k)-time algorithm unless ETH fails when k is the clique-width, becomes fixed-parameter tractable when parameterized by the cliques or trees vertex deletion number.

Cite As Get BibTex

Soh Kumabe. Quadratic Kernel for Cliques or Trees Vertex Deletion. In 36th International Symposium on Algorithms and Computation (ISAAC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 359, pp. 48:1-48:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ISAAC.2025.48

Author Details

Soh Kumabe
  • CyberAgent, Tokyo, Japan

References

  1. Faisal Abu-Khzam. A kernelization algorithm for d-hitting set. Journal of Computer and System Sciences, 76(7):524-531, 2010. URL: https://doi.org/10.1016/j.jcss.2009.09.002.
  2. Matthias Bentert, Michael Fellows, Petr Golovach, Frances Rosamond, and Saket Saurabh. Breaking a graph into connected components with small dominating sets. In International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 24-1, 2024. URL: https://doi.org/10.4230/LIPIcs.MFCS.2024.24.
  3. Benjamin Bergougnoux, Mamadou Moustapha Kanté, and O-joung Kwon. An optimal XP algorithm for hamiltonian cycle on graphs of bounded clique-width. Algorithmica, 82(6):1654-1674, 2020. URL: https://doi.org/10.1007/s00453-019-00663-9.
  4. Stéphane Bessy, Marin Bougeret, Dimitrios Thilikos, and Sebastian Wiederrecht. Kernelization for graph packing problems via rainbow matching. In Symposium on Discrete Algorithms (SODA), pages 3654-3663. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch139.
  5. Jonathan Buss and Judy Goldsmith. Nondeterminism within P^*. SIAM Journal on Computing, 22(3):560-572, 1993. URL: https://doi.org/10.1137/0222038.
  6. Yixin Cao and Dániel Marx. Interval deletion is fixed-parameter tractable. ACM Transactions on Algorithms (TALG), 11(3):1-35, 2015. URL: https://doi.org/10.1145/2629595.
  7. Marek Cygan, Fedor Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized algorithms, volume 5. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-21275-3.
  8. Marek Cygan, Stefan Kratsch, and Jesper Nederlof. Fast hamiltonicity checking via bases of perfect matchings. Journal of the ACM (JACM), 65(3):1-46, 2018. URL: https://doi.org/10.1145/3148227.
  9. Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan MM Van Rooij, and Jakub Onufry Wojtaszczyk. Solving connectivity problems parameterized by treewidth in single exponential time. ACM Transactions on Algorithms (TALG), 18(2):1-31, 2022. URL: https://doi.org/10.1145/3506707.
  10. Martin Doucha and Jan Kratochvíl. Cluster vertex deletion: A parameterization between vertex cover and clique-width. In International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 348-359. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-32589-2_32.
  11. Rod Downey and Michael Fellows. Fixed-parameter tractability and completeness i: Basic results. SIAM Journal on computing, 24(4):873-921, 1995. URL: https://doi.org/10.1137/S0097539792228228.
  12. Michael Fellows, Lars Jaffke, Aliz Izabella Király, Frances Rosamond, and Mathias Weller. What is known about vertex cover kernelization? In Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, pages 330-356. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-98355-4_19.
  13. Fedor Fomin, Petr Golovach, Daniel Lokshtanov, and Saket Saurabh. Almost optimal lower bounds for problems parameterized by clique-width. SIAM Journal on Computing, 43(5):1541-1563, 2014. URL: https://doi.org/10.1137/130910932.
  14. Fedor Fomin, Petr Golovach, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Clique-width III: Hamiltonian cycle and the odd case of graph coloring. ACM Transactions on Algorithms (TALG), 15(1):1-27, 2018. URL: https://doi.org/10.1145/3280824.
  15. Fedor Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, and Meirav Zehavi. Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. ACM Transactions on Algorithms (TALG), 15(1):1-44, 2019. URL: https://doi.org/10.1145/3293466.
  16. Fedor Fomin, Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. Planar ℱ-deletion: Approximation, kernelization and optimal fpt algorithms. In Annual Symposium on Foundations of Computer Science (FOCS), pages 470-479. IEEE, 2012. URL: https://doi.org/10.1109/FOCS.2012.62.
  17. Fedor Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Kernelization: theory of parameterized preprocessing. Cambridge University Press, 2019. Google Scholar
  18. Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale. Metric dimension parameterized by feedback vertex set and other structural parameters. SIAM Journal on Discrete Mathematics, 37(4):2241-2264, 2023. URL: https://doi.org/10.1137/22m1510911.
  19. Robert Ganian. Improving vertex cover as a graph parameter. Discrete Mathematics & Theoretical Computer Science, 17(2):77-100, 2015. URL: https://doi.org/10.46298/dmtcs.2136.
  20. Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, and Manolis Vasilakis. Bandwidth parameterized by cluster vertex deletion number. In International Symposium on Parameterized and Exact Computation (IPEC), volume 285, pages 21:1-21:15, 2023. URL: https://doi.org/10.4230/LIPIcs.IPEC.2023.21.
  21. Petr Golovach, R Krithika, Abhishek Sahu, Saket Saurabh, and Meirav Zehavi. Graph hamiltonicity parameterized by proper interval deletion set. In Latin American Symposium on Theoretical Informatics, pages 104-115. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-61792-9_9.
  22. Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann. A more relaxed model for graph-based data clustering: s-plex cluster editing. SIAM Journal on Discrete Mathematics, 24(4):1662-1683, 2010. URL: https://doi.org/10.1137/090767285.
  23. David Harris and N. S. Narayanaswamy. A faster algorithm for vertex cover parameterized by solution size. In International Symposium on Theoretical Aspects of Computer Science (STACS), volume 289, pages 40:1-40:18, 2024. URL: https://doi.org/10.4230/LIPIcs.STACS.2024.40.
  24. Falk Hüffner, Christian Komusiewicz, Hannes Moser, and Rolf Niedermeier. Fixed-parameter algorithms for cluster vertex deletion. Theory of Computing Systems, 47(1):196-217, 2010. URL: https://doi.org/10.1007/s00224-008-9150-x.
  25. Yoichi Iwata. Linear-time kernelization for feedback vertex set. In International Colloquium on Automata, Languages, and Programming (ICALP), volume 80 of LIPIcs, pages 68:1-68:14, 2017. URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.68.
  26. Ashwin Jacob, Jari JH de Kroon, Diptapriyo Majumdar, and Venkatesh Raman. Deletion to scattered graph classes I-case of finite number of graph classes. Journal of Computer and System Sciences, 138:103460, 2023. URL: https://doi.org/10.1016/j.jcss.2023.05.005.
  27. Ashwin Jacob, Diptapriyo Majumdar, and Venkatesh Raman. Deletion to scattered graph classes II-improved FPT algorithms for deletion to pairs of graph classes. Journal of Computer and System Sciences, 136:280-301, 2023. URL: https://doi.org/10.1016/j.jcss.2023.03.004.
  28. Ashwin Jacob, Diptapriyo Majumdar, and Meirav Zehavi. A polynomial kernel for deletion to the scattered class of cliques and trees. In International Symposium on Algorithms and Computation (ISAAC), volume 322 of LIPIcs, pages 41:1-41:17, 2024. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2024.41.
  29. Ashwin Jacob, Michal Wlodarczyk, and Meirav Zehavi. Finding long directed cycles is hard even when DFVS is small or girth is large. In European Symposium on Algorithms (ESA), volume 274, pages 65:1-65:17, 2023. URL: https://doi.org/10.4230/LIPIcs.ESA.2023.65.
  30. Bart Jansen, Jari de Kroon, and Michal Wlodarczyk. Single-exponential FPT algorithms for enumerating secluded ℱ-free subgraphs and deleting to scattered graph classes. Journal of Computer and System Sciences, 148:103597, 2025. URL: https://doi.org/10.1016/j.jcss.2024.103597.
  31. Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, and Somnath Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions. ACM Transactions on Algorithms (TALG), 12(2):1-41, 2015. URL: https://doi.org/10.1145/2797140.
  32. Stefan Kratsch and Magnus Wahlström. Representative sets and irrelevant vertices: New tools for kernelization. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pages 450-459. IEEE, 2012. URL: https://doi.org/10.1109/FOCS.2012.46.
  33. Michael Lampis, Georgia Kaouri, and Valia Mitsou. On the algorithmic effectiveness of digraph decompositions and complexity measures. Discrete Optimization, 8(1):129-138, 2011. URL: https://doi.org/10.1016/j.disopt.2010.03.010.
  34. Jason Li and Jesper Nederlof. Detecting feedback vertex sets of size k in O^*(2.7^k) time. ACM Transactions on Algorithms (TALG), 18(4):34:1-34:26, 2022. URL: https://doi.org/10.1145/3504027.
  35. Hong Liu, Peng Zhang, and Daming Zhu. On editing graphs into 2-club clusters. In Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (FAW-AAIM), pages 235-246. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-29700-7_22.
  36. Dániel Marx. Chordal deletion is fixed-parameter tractable. Algorithmica, 57:747-768, 2010. URL: https://doi.org/10.1007/s00453-008-9233-8.
  37. Ashutosh Rai and Saket Saurabh. Bivariate complexity analysis of almost forest deletion. Theoretical Computer Science, 708:18-33, 2018. URL: https://doi.org/10.1016/j.tcs.2017.10.021.
  38. Bruce Reed, Kaleigh Smith, and Adrian Vetta. Finding odd cycle transversals. Operations Research Letters, 32(4):299-301, 2004. URL: https://doi.org/10.1016/j.orl.2003.10.009.
  39. Stéphan Thomassé. A 4k² kernel for feedback vertex set. ACM Transactions on Algorithms (TALG), 6(2):32:1-32:8, 2010. URL: https://doi.org/10.1145/1721837.1721848.
  40. Dekel Tsur. Faster algorithms and a smaller kernel for cliques or trees vertex deletion. Information Processing Letters, 190:106570, 2025. URL: https://doi.org/10.1016/j.ipl.2025.106570.
  41. Meirav Zehavi. Tournament fixing parameterized by feedback vertex set number is FPT. In AAAI Conference on Artificial Intelligence, pages 5876-5883, 2023. URL: https://doi.org/10.1609/aaai.v37i5.25728.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact