Sequentially swapping colored tokens on graphs

Katsuhisa Yamanaka; Erik D. Demaine; Takashi Horiyama; Akitoshi Kawamura; Shin Ichi Nakano; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki; Ryuhei Uehara; Takeaki Uno

doi:10.7155/JGAA.00482

Sequentially swapping colored tokens on graphs

Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno

INF - System Information Sciences

Research output: Contribution to journal › Article

1 Citation (Scopus)

Abstract

We consider a puzzle consisting of colored tokens on an n-vertex graph, where each token has a distinct starting vertex and a set of allowable target vertices for it to reach, and the only allowed transformation is to "sequentially" move the chosen token along a path of the graph by swapping it with other tokens on the path.

Original language	English
Pages (from-to)	3-27
Number of pages	25
Journal	Journal of Graph Algorithms and Applications
Volume	23
Issue number	1
DOIs	https://doi.org/10.7155/JGAA.00482
Publication status	Published - 2019 Jan 1

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)
Computer Science Applications
Geometry and Topology
Computational Theory and Mathematics

Access to Document

10.7155/JGAA.00482

Fingerprint Dive into the research topics of 'Sequentially swapping colored tokens on graphs'. Together they form a unique fingerprint.

Cite this

Yamanaka, K., Demaine, E. D., Horiyama, T., Kawamura, A., Nakano, S. I., Okamoto, Y., Saitoh, T., Suzuki, A., Uehara, R., & Uno, T. (2019). Sequentially swapping colored tokens on graphs. Journal of Graph Algorithms and Applications, 23(1), 3-27. https://doi.org/10.7155/JGAA.00482

@article{74e1d3670c884188b3a83c25458f0917,

title = "Sequentially swapping colored tokens on graphs",

abstract = "We consider a puzzle consisting of colored tokens on an n-vertex graph, where each token has a distinct starting vertex and a set of allowable target vertices for it to reach, and the only allowed transformation is to {"}sequentially{"} move the chosen token along a path of the graph by swapping it with other tokens on the path.",

author = "Katsuhisa Yamanaka and Demaine, {Erik D.} and Takashi Horiyama and Akitoshi Kawamura and Nakano, {Shin Ichi} and Yoshio Okamoto and Toshiki Saitoh and Akira Suzuki and Ryuhei Uehara and Takeaki Uno",

year = "2019",

month = jan,

day = "1",

doi = "10.7155/JGAA.00482",

language = "English",

volume = "23",

pages = "3--27",

journal = "Journal of Graph Algorithms and Applications",

issn = "1526-1719",

publisher = "Brown University",

number = "1",

}

TY - JOUR

T1 - Sequentially swapping colored tokens on graphs

AU - Yamanaka, Katsuhisa

AU - Demaine, Erik D.

AU - Horiyama, Takashi

AU - Kawamura, Akitoshi

AU - Nakano, Shin Ichi

AU - Okamoto, Yoshio

AU - Saitoh, Toshiki

AU - Suzuki, Akira

AU - Uehara, Ryuhei

AU - Uno, Takeaki

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We consider a puzzle consisting of colored tokens on an n-vertex graph, where each token has a distinct starting vertex and a set of allowable target vertices for it to reach, and the only allowed transformation is to "sequentially" move the chosen token along a path of the graph by swapping it with other tokens on the path.

AB - We consider a puzzle consisting of colored tokens on an n-vertex graph, where each token has a distinct starting vertex and a set of allowable target vertices for it to reach, and the only allowed transformation is to "sequentially" move the chosen token along a path of the graph by swapping it with other tokens on the path.

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

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

U2 - 10.7155/JGAA.00482

DO - 10.7155/JGAA.00482

M3 - Article

AN - SCOPUS:85068442166

VL - 23

SP - 3

EP - 27

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 1

ER -