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

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルWALCOM
ホスト出版物のサブタイトルAlgorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings
編集者Md. Saidur Rahman, Hsu-Chun Yen, Sheung-Hung Poon
出版社Springer Verlag
ページ435-447
ページ数13
ISBN(印刷版)9783319539249
DOI
出版ステータスPublished - 2017
イベント11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 - Hsinchu, Taiwan, Province of China
継続期間: 2017 3 292017 3 31

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10167 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

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

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Sequentially swapping colored tokens on graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル