Linear-time algorithm for sliding tokens on trees

Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

Suppose that we are given two independent sets Ib and Ir of a graph such that |Ib|=|Ir|, and imagine that a token is placed on each vertex in Ib. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms Ib into Ir 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 thus study the problem restricted to trees, and give the following three results: (1) the decision problem is solvable in linear time; (2) for a yes-instance, we can find in quadratic time an actual sequence of independent sets between Ib and Ir whose length (i.e., the number of token-slides) is quadratic; and (3) there exists an infinite family of instances on paths for which any sequence requires quadratic length.

Original languageEnglish
Pages (from-to)132-142
Number of pages11
JournalTheoretical Computer Science
Volume600
DOIs
Publication statusPublished - Oct 4 2015

Fingerprint

Linear-time Algorithm
Independent Set
Graph in graph theory
Bounded Treewidth
Decision problem
Planar graph
Linear Time
Transform
Path
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Demaine, E. D., Demaine, M. L., Fox-Epstein, E., Hoang, D. A., Ito, T., Ono, H., ... Yamada, T. (2015). Linear-time algorithm for sliding tokens on trees. Theoretical Computer Science, 600, 132-142. https://doi.org/10.1016/j.tcs.2015.07.037

Linear-time algorithm for sliding tokens on trees. / Demaine, Erik D.; Demaine, Martin L.; Fox-Epstein, Eli; Hoang, Duc A.; Ito, Takehiro; Ono, Hirotaka; Otachi, Yota; Uehara, Ryuhei; Yamada, Takeshi.

In: Theoretical Computer Science, Vol. 600, 04.10.2015, p. 132-142.

Research output: Contribution to journalArticle

Demaine, ED, Demaine, ML, Fox-Epstein, E, Hoang, DA, Ito, T, Ono, H, Otachi, Y, Uehara, R & Yamada, T 2015, 'Linear-time algorithm for sliding tokens on trees', Theoretical Computer Science, vol. 600, pp. 132-142. https://doi.org/10.1016/j.tcs.2015.07.037
Demaine ED, Demaine ML, Fox-Epstein E, Hoang DA, Ito T, Ono H et al. Linear-time algorithm for sliding tokens on trees. Theoretical Computer Science. 2015 Oct 4;600:132-142. https://doi.org/10.1016/j.tcs.2015.07.037
Demaine, Erik D. ; Demaine, Martin L. ; Fox-Epstein, Eli ; Hoang, Duc A. ; Ito, Takehiro ; Ono, Hirotaka ; Otachi, Yota ; Uehara, Ryuhei ; Yamada, Takeshi. / Linear-time algorithm for sliding tokens on trees. In: Theoretical Computer Science. 2015 ; Vol. 600. pp. 132-142.
@article{bdef2ef7f85c40bcb71748e6f0bc6799,
title = "Linear-time algorithm for sliding tokens on trees",
abstract = "Suppose that we are given two independent sets Ib and Ir of a graph such that |Ib|=|Ir|, and imagine that a token is placed on each vertex in Ib. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms Ib into Ir 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 thus study the problem restricted to trees, and give the following three results: (1) the decision problem is solvable in linear time; (2) for a yes-instance, we can find in quadratic time an actual sequence of independent sets between Ib and Ir whose length (i.e., the number of token-slides) is quadratic; and (3) there exists an infinite family of instances on paths for which any sequence requires quadratic length.",
author = "Demaine, {Erik D.} and Demaine, {Martin L.} and Eli Fox-Epstein and Hoang, {Duc A.} and Takehiro Ito and Hirotaka Ono and Yota Otachi and Ryuhei Uehara and Takeshi Yamada",
year = "2015",
month = "10",
day = "4",
doi = "10.1016/j.tcs.2015.07.037",
language = "English",
volume = "600",
pages = "132--142",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Linear-time algorithm for sliding tokens on trees

AU - Demaine, Erik D.

AU - Demaine, Martin L.

AU - Fox-Epstein, Eli

AU - Hoang, Duc A.

AU - Ito, Takehiro

AU - Ono, Hirotaka

AU - Otachi, Yota

AU - Uehara, Ryuhei

AU - Yamada, Takeshi

PY - 2015/10/4

Y1 - 2015/10/4

N2 - Suppose that we are given two independent sets Ib and Ir of a graph such that |Ib|=|Ir|, and imagine that a token is placed on each vertex in Ib. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms Ib into Ir 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 thus study the problem restricted to trees, and give the following three results: (1) the decision problem is solvable in linear time; (2) for a yes-instance, we can find in quadratic time an actual sequence of independent sets between Ib and Ir whose length (i.e., the number of token-slides) is quadratic; and (3) there exists an infinite family of instances on paths for which any sequence requires quadratic length.

AB - Suppose that we are given two independent sets Ib and Ir of a graph such that |Ib|=|Ir|, and imagine that a token is placed on each vertex in Ib. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms Ib into Ir 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 thus study the problem restricted to trees, and give the following three results: (1) the decision problem is solvable in linear time; (2) for a yes-instance, we can find in quadratic time an actual sequence of independent sets between Ib and Ir whose length (i.e., the number of token-slides) is quadratic; and (3) there exists an infinite family of instances on paths for which any sequence requires quadratic length.

UR - http://www.scopus.com/inward/record.url?scp=84941260327&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84941260327&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2015.07.037

DO - 10.1016/j.tcs.2015.07.037

M3 - Article

VL - 600

SP - 132

EP - 142

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -