@inproceedings{0296a36c535c4ade84a934e01a62dfe1,
title = "Sequentially swapping colored tokens on graphs",
abstract = "We consider a puzzle consisting of colored tokens on an nvertex 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. This puzzle is a variation of the Fifteen Puzzle and is solvable in O(n3) token-swappings. We thus focus on the problem of minimizing the number of token-swappings to reach the target token-placement. We first give an inapproximability result of this problem, and then show polynomial-time algorithms on trees, complete graphs, and cycles.",
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 = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-53925-6_34",
language = "English",
isbn = "9783319539249",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "435--447",
editor = "Rahman, {Md. Saidur} and Hsu-Chun Yen and Sheung-Hung Poon",
booktitle = "WALCOM",
note = "11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 ; Conference date: 29-03-2017 Through 31-03-2017",
}