Abstract
Suppose that we are given two independent sets I \(_{b}\) and I \(_{r}\) of a graph such that \(\mid \) \({{\varvec{I}}}_{b}\) \(\mid \) = \(\mid \) I \(_{r}\) \(\mid \), and imagine that a token is placed on each vertex in I \(_{b}\) . Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms I \(_{b}\) and I \(_{r}\) so that each independent set in the sequence results from the previous one by sliding exactly one token along an edge in the graph. This problem is known to be PSPACE-complete even for planar graphs, and also for bounded treewidth graphs. In this paper, we show that the problem is solvable for trees in quadratic time. Our proof is constructive: for a yes-instance, we can find an actual sequence of independent sets between I \(_{b}\) and I \(_{r}\) whose length (i.e., the number of token-slides) is quadratic. We note that there exists an infinite family of instances on paths for which any sequence requires quadratic length.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bodlaender, H.L.: A partial \(k\)-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1–45 (1998)
Bonamy, M., Johnson, M., Lignos, I., Patel, V., Paulusma, D.: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Combinatorial Optimization 27, 132–143 (2014)
Bonsma, P.: The complexity of rerouting shortest paths. Theoretical Computer Science 510, 1–12 (2013)
Bonsma, P.: Independent set reconfiguration in cographs. To appear in WG 2014, arXiv:1402.1587 (2014)
Bonsma, P., Cereceda, L.: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theoretical Computer Science 410, 5215–5226 (2009)
Bonsma, P., Kamiński, M., Wrochna, M.: Reconfiguring independent sets in claw-free graphs. In: Ravi, R., Gørtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 86–97. Springer, Heidelberg (2014)
Demaine, E.D., Demaine, M.L., Fox-Epstein, E., Hoang, D.A., Ito, T., Ono, H., Otachi, Y., Uehara, R., Yamada, T.: Linear-time algorithm for sliding tokens on trees arXiv:1406.6576 (2014)
Gopalan, P., Kolaitis, P.G., Maneva, E.N., Papadimitriou, C.H.: The connectivity of Boolean satisfiability: computational and structural dichotomies. SIAM J. Computing 38, 2330–2355 (2009)
Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science 343, 72–96 (2005)
Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A K Peters (2009)
Ito, T., Demaine, E.D., Harvey, N.J.A., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theoretical Computer Science 412, 1054–1065 (2011)
Ito, T., Kamiński, M., Ono, H., Suzuki, A., Uehara, R., Yamanaka, K.: On the parameterized complexity for token jumping on graphs. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) TAMC 2014. LNCS, vol. 8402, pp. 341–351. Springer, Heidelberg (2014)
Ito, T., Kawamura, K., Ono, H., Zhou, X.: Reconfiguration of list \(L(2,1)\)-labelings in a graph. Theoretical Computer Science 544, 84–97 (2014)
Kamiński, M., Medvedev, P., Milanič, M.: Shortest paths between shortest paths. Theoretical Computer Science 412, 5205–5210 (2011)
Kamiński, M., Medvedev, M., Milanič, M.: Complexity of independent set reconfigurability problems. Theoretical Computer Science 439, 9–15 (2012)
Makino, K., Tamaki, S., Yamamoto, M.: An exact algorithm for the Boolean connectivity problem for \(k\)-CNF. Theoretical Computer Science 412, 4613–4618 (2011)
Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 281–294. Springer, Heidelberg (2013)
Mouawad, A.E., Nishimura, N., Raman, V., Wrochna, M.: Reconfiguration over tree decompositions arXiv:1405.2447
van den Heuvel, J.: The complexity of change. Surveys in Combinatorics 2013, London Mathematical Society Lecture Notes Series 409 (2013)
Wrochna, M.: Reconfiguration in bounded bandwidth and treedepth arXiv:1405.0847 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Demaine, E.D. et al. (2014). Polynomial-Time Algorithm for Sliding Tokens on Trees. In: Ahn, HK., Shin, CS. (eds) Algorithms and Computation. ISAAC 2014. Lecture Notes in Computer Science(), vol 8889. Springer, Cham. https://doi.org/10.1007/978-3-319-13075-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-13075-0_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13074-3
Online ISBN: 978-3-319-13075-0
eBook Packages: Computer ScienceComputer Science (R0)