Document Open Access Logo

A Finer View of the Parameterized Landscape of Labeled Graph Contractions

Authors Yashaswini Mathur , Prafullkumar Tale

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2025.43.pdf
  • Filesize: 1.19 MB
  • 19 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Fixed parameter tractability
Keywords
  • Labeled Contraction
  • ETH Lower-bound
  • Treewidth
  • NP-hard

Metrics

Abstract

We study the Labeled Contractibility problem, where the input consists of two vertex-labeled graphs G and H, and the goal is to determine whether H can be obtained from G via a sequence of edge contractions.
Lafond and Marchand [WADS 2025] initiated the parameterized complexity study of this problem, showing it to be W[1]-hard when parameterized by the number k of allowed contractions. They also proved that the problem is fixed-parameter tractable when parameterized by the tree-width tw of G, via an application of Courcelle’s theorem resulting in a non-constructive algorithm.
In this work, we present a constructive fixed-parameter algorithm for Labeled Contractibility with running time 2^{𝒪(tw²)} ⋅ |V(G)|^{𝒪(1)}. We also prove that unless the Exponential Time Hypothesis ({ETH}) fails, it does not admit an algorithm running in time 2^{o(tw²)} ⋅ |V(G)|^{𝒪(1)}. This result adds Labeled Contractibility to a small list of problems that admit such a lower bound and matching algorithm.
We further strengthen existing hardness results by showing that the problem remains NP-complete even when both input graphs have bounded maximum degree. We also investigate parameterizations by (k + δ(G)) where δ(G) denotes the degeneracy of G, and rule out the existence of subexponential-time algorithms. This answers question raised in Lafond and Marchand [WADS 2025]. We additionally provide an improved FPT algorithm with better dependence on (k + δ(G)) than previously known. Finally, we analyze a brute-force algorithm for Labeled Contractibility with running time |V(H)|^{𝒪(|V(G)|)}, and show that this running time is optimal under {ETH}.

Cite As Get BibTex

Yashaswini Mathur and Prafullkumar Tale. A Finer View of the Parameterized Landscape of Labeled Graph Contractions. In 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 360, pp. 43:1-43:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.FSTTCS.2025.43

Author Details

Yashaswini Mathur
  • Indian Institute of Science Education and Research Bhopal, India
Prafullkumar Tale
  • Indian Institute of Science Education and Research Pune, India

Funding

  • Tale, Prafullkumar: INSPIRE Faculty Fellowship by DST, Govt of India.

References

  1. Akanksha Agarwal, Saket Saurabh, and Prafullkumar Tale. On the parameterized complexity of contraction to generalization of trees. Theory of Computing Systems, 63(3):587-614, 2019. URL: https://doi.org/10.1007/s00224-018-9892-z.
  2. Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, and Prafullkumar Tale. Paths to trees and cacti. Theoretical Computer Science, 860:98-116, 2021. URL: https://doi.org/10.1016/j.tcs.2021.01.033.
  3. Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Split contraction: The untold story. ACM Transactions on Computation Theory, 11(3):1-22, 2019. URL: https://doi.org/10.1145/3319909.
  4. Takao Asano and Tomio Hirata. Edge-contraction problems. J. Comput. Syst. Sci., 26(2):197-208, 1983. URL: https://doi.org/10.1016/0022-0000(83)90012-0.
  5. Rémy Belmonte, Petr A. Golovach, Pim Hof, and Daniël Paulusma. Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica, 51(7):473-497, 2014. URL: https://doi.org/10.1007/S00236-014-0204-Z.
  6. Benjamin Bergougnoux, Tuukka Korhonen, and Jesper Nederlof. Tight lower bounds for problems parameterized by rank-width. arXiv preprint, 2210(02117), 2022. URL: https://doi.org/10.48550/arXiv.2210.02117.
  7. Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, and Michal Pilipczuk. A subexponential parameterized algorithm for proper interval completion. SIAM J. Discret. Math., 29(4):1961-1987, 2015. URL: https://doi.org/10.1137/140988565.
  8. Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, and Michal Pilipczuk. Subexponential parameterized algorithm for interval completion. ACM Trans. Algorithms, 14(3):35:1-35:62, 2018. URL: https://doi.org/10.1145/3186896.
  9. Andries E. Brouwer and Henk Jan Veldman. Contractibility and np-completeness. J. Graph Theory, 11(1):71-79, 1987. URL: https://doi.org/10.1002/jgt.3190110111.
  10. Leizhen Cai and Chengwei Guo. Contracting few edges to remove forbidden induced subgraphs. In Proc. of the 8th International Symposium on Parameterized and Exact Computation (IPEC), volume 8246 of LNCS, pages 97-109, 2013. URL: https://doi.org/10.1007/978-3-319-03898-8_10.
  11. Yixin Cao. Linear recognition of almost interval graphs. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pages 1096-1115. SIAM, 2016. URL: https://doi.org/10.1137/1.9781611974331.ch77.
  12. Yixin Cao. Unit interval editing is fixed-parameter tractable. Inf. Comput., 253:109-126, 2017. URL: https://doi.org/10.1016/j.ic.2017.01.008.
  13. Yixin Cao and Dániel Marx. Interval deletion is fixed-parameter tractable. ACM Trans. Algorithms, 11(3):21:1-21:35, 2015. URL: https://doi.org/10.1145/2629595.
  14. Yixin Cao and Dániel Marx. Chordal editing is fixed-parameter tractable. Algorithmica, 75(1):118-137, 2016. URL: https://doi.org/10.1007/s00453-015-0014-x.
  15. Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, and Prafullkumar Tale. Parameterized complexity of isometric path partition: treewidth and diameter. arXiv preprint, 2508(05448), 2025. URL: https://doi.org/10.48550/arXiv.2508.05448.
  16. Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, and Prafullkumar Tale. Tight (double) exponential bounds for identification problems: Locating-dominating set and test cover. 35th International Symposium on Algorithms and Computation (ISAAC 2024), 322:19:1-19:18, 2024. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2024.19.
  17. Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, and Petr A. Golovach. A survey of parameterized algorithms and the complexity of edge modification. CoRR, abs/2001.06867, 2020. URL: https://arxiv.org/abs/2001.06867.
  18. Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, and Petr A. Golovach. A survey of parameterized algorithms and the complexity of edge modification, 2020. URL: https://arxiv.org/abs/2001.06867.
  19. 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.
  20. Marek Cygan, Dániel Marx, Marcin Pilipczuk, and Michal Pilipczuk. Hitting forbidden subgraphs in graphs of bounded treewidth. Inf. Comput., 256:62-82, 2017. URL: https://doi.org/10.1016/J.IC.2017.04.009.
  21. Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, and Jakub Onufry Wojtaszczyk. Solving connectivity problems parameterized by treewidth in single exponential time. ACM Trans. Algorithms, 18(2):17:1-17:31, 2022. URL: https://doi.org/10.1145/3506707.
  22. Andreas Darmann and Janosch Döcker. On a simple hard variant of not-all-equal 3-sat. Theor. Comput. Sci., 815:147-152, 2020. URL: https://doi.org/10.1016/J.TCS.2020.02.010.
  23. Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, and Blair D. Sullivan. On the threshold of intractability. J. Comput. Syst. Sci., 124:1-25, 2022. URL: https://doi.org/10.1016/j.jcss.2021.09.003.
  24. Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, and Yngve Villanger. Exploring subexponential parameterized complexity of completion problems. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS), volume 25 of LIPIcs, pages 288-299, 2014. URL: https://doi.org/10.4230/LIPIcs.STACS.2014.288.
  25. Pål Grønås Drange and Michal Pilipczuk. A polynomial kernel for trivially perfect editing. Algorithmica, 80(12):3481-3524, 2018. URL: https://doi.org/10.1007/s00453-017-0401-6.
  26. Jörg Flum and Martin Grohe. Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2006. URL: https://doi.org/10.1007/3-540-29953-X.
  27. Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, and Yngve Villanger. Tight bounds for parameterized complexity of cluster editing with a small number of clusters. J. Comput. Syst. Sci., 80(7):1430-1447, 2014. URL: https://doi.org/10.1016/j.jcss.2014.04.015.
  28. Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, and Meirav Zehavi. Computation of hadwiger number and related contraction problems: Tight lower bounds. ACM Trans. Comput. Theory, 13(2):10:1-10:25, 2021. URL: https://doi.org/10.1145/3448639.
  29. Fedor V. Fomin and Yngve Villanger. Subexponential parameterized algorithm for minimum fill-in. SIAM J. Comput., 42(6):2197-2216, 2013. URL: https://doi.org/10.1137/11085390X.
  30. Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale. Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover. In 51st International Colloquium on Automata, Languages, and Programming, ICALP, volume 297 of LIPIcs, pages 66:1-66:19, 2024. URL: https://doi.org/10.4230/LIPICS.ICALP.2024.66.
  31. Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale. Metric dimension and geodetic set parameterized by vertex cover. In 42nd International Symposium on Theoretical Aspects of Computer Science, STACS, volume 327 of LIPIcs, pages 33:1-33:20, 2025. URL: https://doi.org/10.4230/LIPICS.STACS.2025.33.
  32. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, and Dimitrios M Thilikos. Increasing the minimum degree of a graph by contractions. Theoretical Computer Science, 481:74-84, 2013. URL: https://doi.org/10.1016/j.tcs.2013.02.030.
  33. Petr A. Golovach, Pim van’t Hof, and Daniël Paulusma. Obtaining planarity by contracting few edges. Theoretical Computer Science, 476:38-46, 2013. URL: https://doi.org/10.1016/j.tcs.2012.12.041.
  34. Sylvain Guillemot and Dániel Marx. A faster FPT algorithm for Bipartite Contraction. Information Processing Letters, 113(22):906-912, 2013. URL: https://doi.org/10.1016/j.ipl.2013.09.004.
  35. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, and Christophe Paul. Contracting graphs to paths and trees. Algorithmica, 68(1):109-132, 2014. URL: https://doi.org/10.1007/s00453-012-9670-2.
  36. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, and Christophe Paul. Obtaining a bipartite graph by contracting few edges. SIAM Journal on Discrete Mathematics, 27(4):2143-2156, 2013. URL: https://doi.org/10.1137/130907392.
  37. Russell Impagliazzo and Ramamohan Paturi. On the complexity of k-sat. J. Comput. Syst. Sci., 62(2):367-375, 2001. URL: https://doi.org/10.1006/JCSS.2000.1727.
  38. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512-530, 2001. URL: https://doi.org/10.1006/JCSS.2001.1774.
  39. Tuukka Korhonen and Daniel Lokshtanov. An improved parameterized algorithm for treewidth. SIAM Journal on Computing, 0(0):STOC23-155-STOC23-214, 2023. URL: https://doi.org/10.1137/23M1595059.
  40. R. Krithika, Pranabendu Misra, and Prafullkumar Tale. A single exponential-time FPT algorithm for cactus contraction. Theor. Comput. Sci., 954:113803, 2023. URL: https://doi.org/10.1016/J.TCS.2023.113803.
  41. Manuel Lafond and Bertrand Marchand. The parameterized landscape of labeled graph contractions. In (To appear) in Algorithms and Data Structures Symposium WADS 2025, volume abs/2502.16096, 2025. URL: https://doi.org/10.48550/arXiv.2502.16096.
  42. John M. Lewis and Mihalis Yannakakis. The node-deletion problem for hereditary properties is np-complete. J. Comput. Syst. Sci., 20(2):219-230, 1980. URL: https://doi.org/10.1016/0022-0000(80)90060-4.
  43. Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. Slightly superexponential parameterized problems. SIAM J. Comput., 47(3):675-702, 2018. URL: https://doi.org/10.1137/16M1104834.
  44. Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. On the hardness of eliminating small induced subgraphs by contracting edges. In Proc. of the 8th International Symposium on Parameterized and Exact Computation (IPEC), volume 8246 of LNCS, pages 243-254, 2013. URL: https://doi.org/10.1007/978-3-319-03898-8_21.
  45. Bertrand Marchand, Nadia Tahiri, Olivier Tremblay Savard, and Manuel Lafond. Finding maximum common contractions between phylogenetic networks. In Solon P. Pissis and Wing-Kin Sung, editors, 24th International Workshop on Algorithms in Bioinformatics, WABI, volume 312 of LIPIcs, pages 16:1-16:24, 2024. URL: https://doi.org/10.4230/LIPICS.WABI.2024.16.
  46. Bertrand Marchand, Nadia Tahiri, Olivier Tremblay-Savard, and Manuel Lafond. Finding Maximum Common Contractions Between Phylogenetic Networks. In WABI, pages 16:1-16:24, 2024. URL: https://doi.org/10.4230/LIPIcs.WABI.2024.16.
  47. Barnaby Martin and Daniël Paulusma. The computational complexity of disconnected cut and 2K₂-partition. Journal of Combinatorial Theory, Series B, 111:17-37, 2015. URL: https://doi.org/10.1016/j.jctb.2014.09.002.
  48. Michal Pilipczuk. Problems parameterized by treewidth tractable in single exponential time: A logical approach. In Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS, volume 6907 of Lecture Notes in Computer Science, pages 520-531. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-22993-0_47.
  49. Ignasi Sau and Uéverton dos Santos Souza. Hitting forbidden induced subgraphs on bounded treewidth graphs. Inf. Comput., 281:104812, 2021. URL: https://doi.org/10.1016/J.IC.2021.104812.
  50. Saket Saurabh and Prafullkumar Tale. On the parameterized complexity of maximum degree contraction problem. arXiv preprint arXiv:2009.11793, 2020. Google Scholar
  51. Saket Saurabh and Prafullkumar Tale. On the parameterized complexity of maximum degree contraction problem. In Proc. of the 15th International Symposium on Parameterized and Exact Computation (IPEC), volume 180 of LIPIcs, pages 26:1-26:16, 2020. URL: https://doi.org/10.4230/LIPIcs.IPEC.2020.26.
  52. Prafullkumar Tale. Double exponential lower bound for telephone broadcast, 2024. URL: https://doi.org/10.48550/arXiv.2403.03501.
  53. Toshimasa Watanabe, Tadashi Ae, and Akira Nakamura. On the removal of forbidden graphs by edge-deletion or by edge-contraction. Discret. Appl. Math., 3(2):151-153, 1981. URL: https://doi.org/10.1016/0166-218X(81)90039-1.
  54. Mihalis Yannakakis. Node- and Edge-Deletion NP-Complete Problems. In Proc. of the 10th Annual ACM Symposium on Theory of Computing (STOC), pages 253-264, 1978. URL: https://doi.org/10.1145/800133.804355.
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