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

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)3-27
Number of pages25
JournalJournal of Graph Algorithms and Applications
Volume23
Issue number1
DOIs
Publication statusPublished - Jan 1 2019

Fingerprint

Path
Graph in graph theory
Vertex of a graph
Distinct
Target

All Science Journal Classification (ASJC) codes

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

Cite this

Yamanaka, K., Demaine, E. D., Horiyama, T., Kawamura, A., Nakano, S. I., Okamoto, Y., ... 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

Sequentially swapping colored tokens on graphs. / Yamanaka, Katsuhisa; Demaine, Erik D.; Horiyama, Takashi; Kawamura, Akitoshi; Nakano, Shin Ichi; Okamoto, Yoshio; Saitoh, Toshiki; Suzuki, Akira; Uehara, Ryuhei; Uno, Takeaki.

In: Journal of Graph Algorithms and Applications, Vol. 23, No. 1, 01.01.2019, p. 3-27.

Research output: Contribution to journalArticle

Yamanaka, K, Demaine, ED, Horiyama, T, Kawamura, A, Nakano, SI, Okamoto, Y, Saitoh, T, Suzuki, A, Uehara, R & Uno, T 2019, 'Sequentially swapping colored tokens on graphs', Journal of Graph Algorithms and Applications, vol. 23, no. 1, pp. 3-27. https://doi.org/10.7155/JGAA.00482
Yamanaka K, Demaine ED, Horiyama T, Kawamura A, Nakano SI, Okamoto Y et al. Sequentially swapping colored tokens on graphs. Journal of Graph Algorithms and Applications. 2019 Jan 1;23(1):3-27. https://doi.org/10.7155/JGAA.00482
Yamanaka, Katsuhisa ; Demaine, Erik D. ; Horiyama, Takashi ; Kawamura, Akitoshi ; Nakano, Shin Ichi ; Okamoto, Yoshio ; Saitoh, Toshiki ; Suzuki, Akira ; Uehara, Ryuhei ; Uno, Takeaki. / Sequentially swapping colored tokens on graphs. In: Journal of Graph Algorithms and Applications. 2019 ; Vol. 23, No. 1. pp. 3-27.
@article{fe72f64295a5481cb2084f84fa508443,
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 = "1",
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

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 -