Document Open Access Logo

Revisiting Token Sliding on Chordal Graphs

Authors Rajat Adak , Saraswati Girish Nanoti , Prafullkumar Tale

PDF

File

Thumbnail PDF
PDF
LIPIcs.WG.2026.1.pdf
  • Filesize: 1.24 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Independent Set
  • Token Sliding
  • Chordal Graphs
  • Leafage
  • W[1]-hardness

Metrics

Abstract

In this article, we revisit the complexity of the reconfiguration of independent sets under the token sliding rule on chordal graphs. In the Token Sliding Connectivity problem, the input is a graph G and an integer k, and the objective is to determine whether the reconfiguration graph TS_k(G) of G is connected. The vertices of TS_k(G) are k-independent sets of G, and two vertices are adjacent if and only if one can transform one of the two corresponding independent sets into the other by sliding a vertex (also called a token) along an edge. Bonamy and Bousquet [WG'17] proved that the Token Sliding Connectivity problem is polynomial-time solvable on interval graphs but NP-hard on split graphs. In light of these two results, the authors asked: can we decide the connectivity of TS_k(G) in polynomial time for chordal graphs with maximum clique-tree degree d? We answer this question in the negative and prove that the problem is NP-hard even when d = 4. We then study the parameterized complexity of the problem for a larger parameter called leafage and prove that the problem is co-W[1]-hard. We prove similar results for a closely related problem called Token Sliding Reachability. In this problem, the input is a graph G with two of its k-independent sets I and J, and the objective is to determine whether there is a sequence of valid token sliding moves that transform I into J.

Cite As Get BibTex

Rajat Adak, Saraswati Girish Nanoti, and Prafullkumar Tale. Revisiting Token Sliding on Chordal Graphs. In 52nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 376, pp. 1:1-1:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.WG.2026.1

Author Details

Rajat Adak
  • Indian Institute of Science, Bangalore, India
Saraswati Girish Nanoti
  • Indian Institute of Science, Bangalore, India
Prafullkumar Tale
  • Indian Institute of Science Education and Research Pune, India

Funding

  • Tale, Prafullkumar: Supported by ARG-MATRICS Grant titled MaPLE (ARGM/2026/ 0089).

References

  1. Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima. Well-partitioned chordal graphs. Discret. Math., 345(10):112985, 2022. URL: https://doi.org/10.1016/J.DISC.2022.112985.
  2. Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, and Peter Zeman. Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. CoRR, abs/2107.10689, 2021. URL: https://arxiv.org/abs/2107.10689.
  3. Kathleen D. Barnetson, Andrea C. Burgess, Jessica A. Enright, Jared Howell, David A. Pike, and Brady Ryan. The firebreak problem. Networks, 77(3):372-382, 2021. URL: https://doi.org/10.1002/net.21975.
  4. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, and Florian Sikora. Token Sliding on Split Graphs. Theory Comput. Syst., 65(4):662-686, 2021. URL: https://doi.org/10.1007/S00224-020-09967-8.
  5. Jean R. S. Blair and Barry Peyton. An Introduction to Chordal Graphs and Clique Trees. In Graph Theory and Sparse Matrix Computation, pages 1-29, New York, NY, 1993. Springer New York. Google Scholar
  6. Marthe Bonamy and Nicolas Bousquet. Recoloring bounded treewidth graphs. Electron. Notes Discret. Math., 44:257-262, 2013. URL: https://doi.org/10.1016/J.ENDM.2013.10.040.
  7. Marthe Bonamy and Nicolas Bousquet. Token Sliding on Chordal Graphs. In Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, volume 10520 of Lecture Notes in Computer Science, pages 127-139. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-68705-6_10.
  8. Marthe Bonamy, Nicolas Bousquet, Carl Feghali, and Matthew Johnson. On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory B, 135:179-199, 2019. URL: https://doi.org/10.1016/J.JCTB.2018.08.002.
  9. Paul S. Bonsma. The complexity of rerouting shortest paths. Theor. Comput. Sci., 510:1-12, 2013. URL: https://doi.org/10.1016/J.TCS.2013.09.012.
  10. Paul S. Bonsma, Marcin Kaminski, and Marcin Wrochna. Reconfiguring Independent Sets in Claw-Free Graphs. In Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, volume 8503 of Lecture Notes in Computer Science, pages 86-97. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-08404-6_8.
  11. Nicolas Bousquet, Arnaud Mary, and Aline Parreau. Token Jumping in Minor-Closed Classes. In Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, volume 10472 of Lecture Notes in Computer Science, pages 136-149. Springer, 2017. URL: https://doi.org/10.1007/978-3-662-55751-8_12.
  12. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada. Polynomial-Time Algorithm for Sliding Tokens on Trees. In Algorithms and Computation - 25th International Symposium, ISAAC 2014, volume 8889 of Lecture Notes in Computer Science, pages 389-400. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-13075-0_31.
  13. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada. Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci., 600:132-142, 2015. URL: https://doi.org/10.1016/J.TCS.2015.07.037.
  14. Carl Feghali, Matthew Johnson, and Daniël Paulusma. A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. J. Graph Theory, 83(4):340-358, 2016. URL: https://doi.org/10.1002/JGT.22000.
  15. Carl Feghali, Matthew Johnson, and Daniël Paulusma. Kempe equivalence of colourings of cubic graphs. Eur. J. Comb., 59:1-10, 2017. URL: https://doi.org/10.1016/J.EJC.2016.06.008.
  16. Fedor V. Fomin, Petr A. Golovach, and Jean-Florent Raymond. On the Tractability of Optimization Problems on H-graphs. Algorithmica, 82(9):2432-2473, 2020. URL: https://doi.org/10.1007/s00453-020-00692-9.
  17. Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, and Ryuhei Uehara. Sliding Token on Bipartite Permutation Graphs. In Khaled M. Elbassioni and Kazuhisa Makino, editors, Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings, volume 9472 of Lecture Notes in Computer Science, pages 237-247. Springer, 2015. URL: https://doi.org/10.1007/978-3-662-48971-0_21.
  18. Mathew C. Francis and Veena Prabhakaran. Token Sliding Independent Set Reconfiguration on Block Graphs. In 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2025, BITS Pilani, K K Birla Goa Campus, India, December 17-19, 2025, volume 360 of LIPIcs, pages 31:1-31:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2025.31.
  19. Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, and Prafullkumar Tale. Domination and cut problems on chordal graphs with bounded leafage. Algorithmica, 86(5):1428-1474, 2024. URL: https://doi.org/10.1007/S00453-023-01196-Y.
  20. Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, and Christos H. Papadimitriou. The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. SIAM J. Comput., 38(6):2330-2355, 2009. URL: https://doi.org/10.1137/07070440X.
  21. Michel Habib and Juraj Stacho. Polynomial-Time Algorithm for the Leafage of Chordal Graphs. In Algorithms - ESA 2009, 17th Annual European Symposium, volume 5757 of Lecture Notes in Computer Science, pages 290-300. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-04128-0_27.
  22. Robert A. Hearn and Erik D. Demaine. PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci., 343(1-2):72-96, 2005. URL: https://doi.org/10.1016/J.TCS.2005.05.008.
  23. Duc A. Hoang and Ryuhei Uehara. Sliding Tokens on a Cactus. In 27th International Symposium on Algorithms and Computation, ISAAC 2016, volume 64 of LIPIcs, pages 37:1-37:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2016.37.
  24. Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, and Georg Still. In Memoriam Walter Kern. Discret. Appl. Math., 303:2-3, 2021. URL: https://doi.org/10.1016/j.dam.2021.08.034.
  25. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, and Yushi Uno. On the complexity of reconfiguration problems. Theor. Comput. Sci., 412(12-14):1054-1065, 2011. URL: https://doi.org/10.1016/J.TCS.2010.12.005.
  26. Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, and Katsuhisa Yamanaka. On the Parameterized Complexity for Token Jumping on Graphs. In Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, volume 8402 of Lecture Notes in Computer Science, pages 341-351. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-06089-7_24.
  27. Takehiro Ito, Marcin Jakub Kaminski, and Hirotaka Ono. Fixed-Parameter Tractability of Token Jumping on Planar Graphs. In Algorithms and Computation - 25th International Symposium, ISAAC 2014, volume 8889 of Lecture Notes in Computer Science, pages 208-219. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-13075-0_17.
  28. Marcin Kaminski, Paul Medvedev, and Martin Milanic. Complexity of independent set reconfigurability problems. Theor. Comput. Sci., 439:9-15, 2012. URL: https://doi.org/10.1016/J.TCS.2012.03.004.
  29. Daniel Lokshtanov and Amer E. Mouawad. The Complexity of Independent Set Reconfiguration on Bipartite Graphs. ACM Trans. Algorithms, 15(1):7:1-7:19, 2019. URL: https://doi.org/10.1145/3280825.
  30. Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, and Akira Suzuki. On the Parameterized Complexity of Reconfiguration Problems. Algorithmica, 78(1):274-297, 2017. URL: https://doi.org/10.1007/S00453-016-0159-2.
  31. Naomi Nishimura. Introduction to Reconfiguration. Algorithms, 11(4):52, 2018. URL: https://doi.org/10.3390/A11040052.
  32. Charis Papadopoulos and Spyridon Tzimas. Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. In Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, volume 13270 of Lecture Notes in Computer Science, pages 466-479. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-06678-8_34.
  33. Jan van den Heuvel. The complexity of change. In Surveys in Combinatorics 2013, volume 409 of London Mathematical Society Lecture Note Series, pages 127-160. Cambridge University Press, 2013. URL: https://doi.org/10.1017/CBO9781139506748.005.
  34. Takeshi Yamada and Ryuhei Uehara. Shortest Reconfiguration of Sliding Tokens on a Caterpillar. In WALCOM: Algorithms and Computation - 10th International Workshop, WALCOM 2016, volume 9627 of Lecture Notes in Computer Science, pages 236-248. Springer, 2016. URL: https://doi.org/10.1007/978-3-319-30139-6_19.
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-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact