説明
We investigate the computational complexity of the followingproblem. We are given a graph in which each vertex has the current and target colors. Each pair of adjacent vertices can swap their current colors. Our goal is to perform as small numbers of swappings as possible so that the current and target colors agree at each vertex. When the colors are chosen from {1,2,...,c}, we call this problem c-Colored Token Swapping since the current color of a vertex can be seen as a colored token placed on the vertex. We show that c-Colored Token Swapping is NP-complete for every constant c>3 even if input graphs are restricted to connected planar bipartite graphs of maximum degree 3. We then show that 2-Colored Token Swapping can be solved in polynomial time for general graphs and in linear time for trees.
Algorithms and Data Structures, 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings
identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/13768
収録刊行物
-
- Lecture Notes in Computer Science
-
Lecture Notes in Computer Science 9214 619-628, 2015-08-05
Springer
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1050845762468625920
-
- NII論文ID
- 120005850327
-
- ISSN
- 03029743
- 16113349
-
- 本文言語コード
- en
-
- 資料種別
- journal article
-
- データソース種別
-
- IRDB
- Crossref
- CiNii Articles
- KAKEN
- OpenAIRE
