The time complexity of the token swapping problem and its parallel variants

Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings
EditorsMd. Saidur Rahman, Hsu-Chun Yen, Sheung-Hung Poon
PublisherSpringer Verlag
Pages448-459
Number of pages12
ISBN (Print)9783319539249
DOIs
Publication statusPublished - 2017 Jan 1
Event11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 - Hsinchu, Taiwan, Province of China
Duration: 2017 Mar 292017 Mar 31

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10167 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017
CountryTaiwan, Province of China
CityHsinchu
Period17/3/2917/3/31

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The time complexity of the token swapping problem and its parallel variants'. Together they form a unique fingerprint.

  • Cite this

    Kawahara, J., Saitoh, T., & Yoshinaka, R. (2017). The time complexity of the token swapping problem and its parallel variants. In M. S. Rahman, H-C. Yen, & S-H. Poon (Eds.), WALCOM: Algorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings (pp. 448-459). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10167 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-53925-6_35