Document Open Access Logo

Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations

Authors Marin Bougeret , Bart M. P. Jansen , Ignasi Sau

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.33.pdf
  • Filesize: 1.03 MB
  • 20 pages

Document Identifiers

Author Details

Marin Bougeret
  • LIRMM, Université de Montpellier, CNRS, France
Bart M. P. Jansen
  • Eindhoven University of Technology, The Netherlands
Ignasi Sau
  • LIRMM, Université de Montpellier, CNRS, France

Funding

  • Jansen, Bart M. P.: Supported by the Dutch Research Council (NWO) through Gravitation-grant NETWORKS-024.002.003.
  • Sau, Ignasi: Supported by the French project ELIT (ANR-20-CE48-0008-01).

Cite AsGet BibTex

Marin Bougeret, Bart M. P. Jansen, and Ignasi Sau. Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 33:1-33:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.33

Abstract

For a fixed graph H, the H-Subgraph Hitting problem consists in deleting the minimum number of vertices from an input graph to obtain a graph without any occurrence of H as a subgraph. This problem can be seen as a generalization of Vertex Cover, which corresponds to the case H = K₂. We initiate a study of H-Subgraph Hitting from the point of view of characterizing structural parameterizations that allow for polynomial kernels, within the recently active framework of taking as the parameter the number of vertex deletions to obtain a graph in a "simple" class 𝒞. Our main contribution is to identify graph parameters that, when H-Subgraph Hitting is parameterized by the vertex-deletion distance to a class 𝒞 where any of these parameters is bounded, and assuming standard complexity assumptions and that H is biconnected, allow us to prove the following sharp dichotomy: the problem admits a polynomial kernel if and only if H is a clique. These new graph parameters are inspired by the notion of 𝒞-elimination distance introduced by Bulian and Dawar [Algorithmica 2016], and generalize it in two directions. Our results also apply to the version of the problem where one wants to hit H as an induced subgraph, and imply in particular, that the problems of hitting minors and hitting (induced) subgraphs have a substantially different behavior with respect to the existence of polynomial kernels under structural parameterizations.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • hitting subgraphs
  • hitting induced subgraphs
  • parameterized complexity
  • polynomial kernel
  • complexity dichotomy
  • elimination distance

Metrics

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

Related Versions

References

  1. Faisal N. 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. Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, and Meirav Zehavi. Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. In Proc. of the 32st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1976-2004, 2022. URL: https://doi.org/10.1137/1.9781611977073.79.
  3. Júlio Araújo, Marin Bougeret, Victor A. Campos, and Ignasi Sau. Parameterized complexity of computing maximum minimal blocking and hitting sets. Algorithmica, 85(2):444-491, 2023. URL: https://doi.org/10.1007/s00453-022-01036-5.
  4. Julien Baste, Ignasi Sau, and Dimitrios M. Thilikos. Hitting minors on bounded treewidth graphs. IV. an optimal algorithm. SIAM Journal on Computing, 52(4):865-912, 2023. URL: https://doi.org/10.1137/21m140482x.
  5. Hans L. Bodlaender. Kernelization, exponential lower bounds. In Encyclopedia of Algorithms, pages 1013-1017. Springer, 2016. URL: https://doi.org/10.1007/978-1-4939-2864-4_521.
  6. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, and Danny Hermelin. On problems without polynomial kernels. Journal of Computer and System Sciences, 75(8):423-434, 2009. URL: https://doi.org/10.1016/j.jcss.2009.04.001.
  7. Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Cross-composition: A new technique for kernelization lower bounds. In Proc. of the 28th 28th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 9 of LIPIcs, pages 165-176, 2011. URL: https://doi.org/10.4230/LIPIcs.STACS.2011.165.
  8. Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Kernelization lower bounds by cross-composition. SIAM Journal on Discrete Mathematics, 28(1):277-305, 2014. URL: https://doi.org/10.1137/120880240.
  9. Hans L. Bodlaender, Stéphan Thomassé, and Anders Yeo. Kernel bounds for disjoint cycles and disjoint paths. Theoretical Computer Science, 412(35):4570-4578, 2011. URL: https://doi.org/10.1016/j.tcs.2011.04.039.
  10. Marin Bougeret, Bart M. P. Jansen, and Ignasi Sau. Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel. SIAM Journal on Discrete Mathematics, 36(4):2737-2773, 2022. URL: https://doi.org/10.1137/21m1400766.
  11. Marin Bougeret, Bart M. P. Jansen, and Ignasi Sau. Kernelization dichotomies for hitting subgraphs under structural parameterizations. CoRR, abs/2404.16695, 2024. URL: https://arxiv.org/abs/2404.16695.
  12. Marin Bougeret and Ignasi Sau. How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? Algorithmica, 81(10):4043-4068, 2019. URL: https://doi.org/10.1007/s00453-018-0468-8.
  13. Jannis Bulian and Anuj Dawar. Graph isomorphism parameterized by elimination distance to bounded degree. Algorithmica, 75(2):363-382, 2016. URL: https://doi.org/10.1007/s00453-015-0045-3.
  14. Jannis Bulian and Anuj Dawar. Fixed-parameter tractable distances to sparse graph classes. Algorithmica, 79(1):139-158, 2017. URL: https://doi.org/10.1007/s00453-016-0235-7.
  15. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-21275-3.
  16. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. On the hardness of losing width. Theory of Computing Systems, 54(1):73-82, 2014. URL: https://doi.org/10.1007/s00224-013-9480-1.
  17. Marek Cygan, Dániel Marx, Marcin Pilipczuk, and Michal Pilipczuk. Hitting forbidden subgraphs in graphs of bounded treewidth. Information and Computation, 256:62-82, 2017. URL: https://doi.org/10.1016/j.ic.2017.04.009.
  18. David Dekker and Bart M. P. Jansen. Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. In Proc. of the 48th International Workshop Graph-Theoretic Concepts in Computer Science (WG), volume 13453 of LNCS, pages 158-172, 2022. URL: https://doi.org/10.1007/978-3-031-15914-5_12.
  19. Holger Dell and Dieter van Melkebeek. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. Journal of the ACM, 61(4):23:1-23:27, 2014. URL: https://doi.org/10.1145/2629620.
  20. Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. 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, volume 11011 of LNCS, pages 330-356, 2018. URL: https://doi.org/10.1007/978-3-319-98355-4_19.
  21. Jörg Flum and Martin Grohe. Parameterized Complexity Theory. Springer-Verlag, 2006. URL: https://doi.org/10.1007/3-540-29953-X.
  22. Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos. Parameterized complexity of elimination distance to first-order logic properties. ACM Transactions on Computational Logic, 23(3):17:1-17:35, 2022. URL: https://doi.org/10.1145/3517129.
  23. Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. In Proc. of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2012. URL: https://doi.org/10.1109/FOCS.2012.62.
  24. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, 2019. URL: https://doi.org/10.1017/9781107415157.
  25. Fedor V. Fomin and Torstein J. F. Strømme. Vertex cover structural parameterization revisited. In Proc. of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 9941 of LNCS, pages 171-182, 2016. URL: https://doi.org/10.1007/978-3-662-53536-3_15.
  26. Lance Fortnow and Rahul Santhanam. Infeasibility of instance compression and succinct PCPs for NP. Journal of Computer and System Sciences, 77(1):91-106, 2011. URL: https://doi.org/10.1016/j.jcss.2010.06.007.
  27. Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, and Somnath Sikdar. Kernelization using structural parameters on sparse graph classes. In Proc. of the 21st Annual European Symposium on Algorithms (ESA), volume 8125 of LNCS, pages 529-540, 2013. URL: https://doi.org/10.1007/978-3-642-40450-4_45.
  28. Jiong Guo, Falk Hüffner, and Rolf Niedermeier. A structural view on parameterizing problems: Distance from triviality. In Proc. of the 1st International Workshop on Parameterized and Exact Computation (IWPEC), volume 3162 of LNCS, pages 162-173, 2004. URL: https://doi.org/10.1007/978-3-540-28639-4_15.
  29. Eva-Maria C. Hols, Stefan Disc.tsch, and Astrid Pieterse. Elimination distances, blocking sets, and kernels for vertex cover. SIAM Journal on Discrete Mathematics, 36(3):1955-1990, 2022. URL: https://doi.org/10.1137/20m1335285.
  30. Bart M. P. Jansen and Hans L. Bodlaender. Vertex cover kernelization revisited - upper and lower bounds for a refined parameter. Theory of Computing Systems, 53(2):263-299, 2013. URL: https://doi.org/10.1007/s00224-012-9393-4.
  31. Bart M. P. Jansen, Jari J. H. de Kroon, and Michal Włodarczyk. Vertex deletion parameterized by elimination distance and even less. In Proc. of the 53rd Annual ACM Symposium on Theory of Computing (STOC), pages 1757-1769, 2021. URL: https://doi.org/10.1145/3406325.3451068.
  32. Bart M. P. Jansen and Stefan Kratsch. On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. In Proc. of the 6th International Symposium on Parameterized and Exact Computation (IPEC), volume 7112 of LNCS, pages 132-144, 2011. URL: https://doi.org/10.1007/978-3-642-28050-4_11.
  33. Bart M. P. Jansen and Astrid Pieterse. Polynomial kernels for hitting forbidden minors under structural parameterizations. Theoretical Computer Science, 841:124-166, 2020. URL: https://doi.org/10.1016/j.tcs.2020.07.009.
  34. Bart M. P. Jansen and Michal Wlodarczyk. Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. In Proc of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 900-913, 2022. URL: https://doi.org/10.1145/3519935.3520021.
  35. Ton Kloks. Treewidth, Computations and Approximations, volume 842 of LNCS. Springer, 1994. URL: https://doi.org/10.1007/BFb0045375.
  36. Stefan Kratsch. A randomized polynomial kernelization for vertex cover with a smaller parameter. SIAM Journal on Discrete Mathematics, 32(3):1806-1839, 2018. URL: https://doi.org/10.1137/16M1104585.
  37. Stefan Kratsch and Magnus Wahlström. Representative sets and irrelevant vertices: New tools for kernelization. Journal of the ACM, 67(3):16:1-16:50, 2020. URL: https://doi.org/10.1145/3390887.
  38. John M. Lewis and Mihalis Yannakakis. The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20(2):219-230, 1980. Google Scholar
  39. Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. Kernelization - Preprocessing with a guarantee. In The Multivariate Algorithmic Revolution and Beyond, pages 129-161, 2012. URL: https://doi.org/10.1007/978-3-642-30891-8_10.
  40. Diptapriyo Majumdar, Venkatesh Raman, and Saket Saurabh. Polynomial kernels for vertex cover parameterized by small degree modulators. Theory of Computing Systems, 62(8):1910-1951, 2018. URL: https://doi.org/10.1007/s00224-018-9858-1.
  41. Laure Morelle, Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos. Faster parameterized algorithms for modification problems to minor-closed classes. In Proc. of the 50th International Colloquium on Automata, Languages, and Programming (ICALP), volume 261 of LIPIcs, pages 93:1-93:19, 2023. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.93.
  42. Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, and Alexandre Vigny. Algorithms and data structures for first-order logic with connectivity under vertex failures. In Proc. of the 49th International Colloquium on Automata, Languages, and Programming (ICALP), volume 229 of LIPIcs, pages 102:1-102:18, 2022. URL: https://doi.org/10.4230/LIPICS.ICALP.2022.102.
  43. Ignasi Sau and Uéverton dos Santos Souza. Hitting forbidden induced subgraphs on bounded treewidth graphs. Information and Computation, 281:104812, 2021. URL: https://doi.org/10.1016/j.ic.2021.104812.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

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