Complexity of coloring reconfiguration under recolorability constraints

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

For an integer k 1, k-coloring reconfiguration is one of the most well-studied reconfiguration problems, defined as follows: In the problem, we are given two (vertex)colorings of a graph using k colors, and asked to transform one into the other by recoloring only one vertex at a time, while at all times maintaining a proper coloring. The problem is known to be PSPACE-complete if k 4, and solvable for any graph in polynomial time if k 3. In this paper, we introduce a recolorability constraint on the k colors, which forbids some pairs of colors to be recolored directly. The recolorability constraint is given in terms of an undirected graph R such that each node in R corresponds to a color and each edge in R represents a pair of colors that can be recolored directly. We study the hardness of the problem based on the structure of recolorability constraints R. More specifically, we prove that the problem is PSPACE-complete if R is of maximum degree at least four, or has a connected component containing more than one cycle.

本文言語English
ホスト出版物のタイトル28th International Symposium on Algorithms and Computation, ISAAC 2017
編集者Takeshi Tokuyama, Yoshio Okamoto
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770545
DOI
出版ステータスPublished - 2017 12 1
イベント28th International Symposium on Algorithms and Computation, ISAAC 2017 - Phuket, Thailand
継続期間: 2017 12 92017 12 22

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
92
ISSN(印刷版)1868-8969

Other

Other28th International Symposium on Algorithms and Computation, ISAAC 2017
国/地域Thailand
CityPhuket
Period17/12/917/12/22

ASJC Scopus subject areas

  • ソフトウェア

フィンガープリント

「Complexity of coloring reconfiguration under recolorability constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル