TY - GEN
T1 - The time complexity of the token swapping problem and its parallel variants
AU - Kawahara, Jun
AU - Saitoh, Toshiki
AU - Yoshinaka, Ryo
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - The token swapping problem (TSP) and its colored version are reconfiguration problems on graphs. This paper is concerned with the complexity of the TSP and two new variants; namely parallel TSP and parallel colored TSP. For a given graph where each vertex has a unique token on it, the TSP requires to find a shortest way to modify a token placement into another by swapping tokens on adjacent vertices. In the colored version, vertices and tokens are colored and the goal is to relocate tokens so that each vertex has a token of the same color. Their parallel versions allow simultaneous swaps on non-incident edges in one step. We investigate the time complexity of several restricted cases of those problems and show when those problems become tractable and remain intractable.
AB - The token swapping problem (TSP) and its colored version are reconfiguration problems on graphs. This paper is concerned with the complexity of the TSP and two new variants; namely parallel TSP and parallel colored TSP. For a given graph where each vertex has a unique token on it, the TSP requires to find a shortest way to modify a token placement into another by swapping tokens on adjacent vertices. In the colored version, vertices and tokens are colored and the goal is to relocate tokens so that each vertex has a token of the same color. Their parallel versions allow simultaneous swaps on non-incident edges in one step. We investigate the time complexity of several restricted cases of those problems and show when those problems become tractable and remain intractable.
UR - http://www.scopus.com/inward/record.url?scp=85014234196&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85014234196&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-53925-6_35
DO - 10.1007/978-3-319-53925-6_35
M3 - Conference contribution
AN - SCOPUS:85014234196
SN - 9783319539249
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 448
EP - 459
BT - WALCOM
A2 - Rahman, Md. Saidur
A2 - Yen, Hsu-Chun
A2 - Poon, Sheung-Hung
PB - Springer Verlag
T2 - 11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017
Y2 - 29 March 2017 through 31 March 2017
ER -