Polynomial-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

doi:10.1007/978-3-319-13075-0_31

Polynomial-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

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Chapter

9 Citations (Scopus)

Abstract

Suppose that we are given two independent sets I b and I^r of a graph such that |I^b| =

Original language	English
Title of host publication	Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings
Editors	Hee-Kap Ahn, Chan-Su Shin
Publisher	Springer-Verlag
Pages	389-400
Number of pages	12
ISBN (Electronic)	9783319130743
DOIs	https://doi.org/10.1007/978-3-319-13075-0_31
Publication status	Published - 2014 Jan 1

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8889
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-13075-0_31

Fingerprint Dive into the research topics of 'Polynomial-time algorithm for sliding tokens on trees'. Together they form a unique fingerprint.

Cite this

Demaine, E. D., Demaine, M. L., Fox-Epstein, E., Hoang, D. A., Ito, T., Ono, H., Otachi, Y., Uehara, R., & Yamada, T. (2014). Polynomial-time algorithm for sliding tokens on trees. In H-K. Ahn, & C-S. Shin (Eds.), Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings (pp. 389-400). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8889). Springer-Verlag. https://doi.org/10.1007/978-3-319-13075-0_31

Polynomial-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.

Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. ed. / Hee-Kap Ahn; Chan-Su Shin. Springer-Verlag, 2014. p. 389-400 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8889).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Demaine, ED, Demaine, ML, Fox-Epstein, E, Hoang, DA, Ito, T, Ono, H, Otachi, Y, Uehara, R & Yamada, T 2014, Polynomial-time algorithm for sliding tokens on trees. in H-K Ahn & C-S Shin (eds), Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8889, Springer-Verlag, pp. 389-400. https://doi.org/10.1007/978-3-319-13075-0_31

Demaine ED, Demaine ML, Fox-Epstein E, Hoang DA, Ito T, Ono H et al. Polynomial-time algorithm for sliding tokens on trees. In Ahn H-K, Shin C-S, editors, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Springer-Verlag. 2014. p. 389-400. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-13075-0_31

Demaine, Erik D. ; Demaine, Martin L. ; Fox-Epstein, Eli ; Hoang, Duc A. ; Ito, Takehiro ; Ono, Hirotaka ; Otachi, Yota ; Uehara, Ryuhei ; Yamada, Takeshi. / Polynomial-time algorithm for sliding tokens on trees. Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. editor / Hee-Kap Ahn ; Chan-Su Shin. Springer-Verlag, 2014. pp. 389-400 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{1155dad286654d80a501839e930e9c9c,

title = "Polynomial-time algorithm for sliding tokens on trees",

abstract = "Suppose that we are given two independent sets I b and Ir of a graph such that |Ib| =",

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 = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-319-13075-0_31",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "389--400",

editor = "Hee-Kap Ahn and Chan-Su Shin",

booktitle = "Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings",

}

TY - CHAP

T1 - Polynomial-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 - 2014/1/1

Y1 - 2014/1/1

N2 - Suppose that we are given two independent sets I b and Ir of a graph such that |Ib| =

AB - Suppose that we are given two independent sets I b and Ir of a graph such that |Ib| =

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

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

U2 - 10.1007/978-3-319-13075-0_31

DO - 10.1007/978-3-319-13075-0_31

M3 - Chapter

AN - SCOPUS:84921646724

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 389

EP - 400

BT - Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings

A2 - Ahn, Hee-Kap

A2 - Shin, Chan-Su

PB - Springer-Verlag

ER -