Algorithms for coloring reconfiguration under recolorability constraints

研究成果: Conference contribution

抄録

Coloring reconfiguration is one of the most well-studied reconfiguration problems. In the problem, we are given two (vertex-)colorings of a graph using at most k colors, and asked to determine whether there exists a transformation between them by recoloring only a single vertex at a time, while maintaining a k-coloring throughout. It is known that this problem is solvable in linear time for any graph if k ≤ 3, while is PSPACE-complete for a fixed k ≥ 4. In this paper, we further investigate the problem from the viewpoint of recolorability constraints, which forbid some pairs of colors to be recolored directly. More specifically, 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. In this paper, we give a linear-time algorithm to solve the problem under such a recolorability constraint if R is of maximum degree at most two. In addition, we show that the minimum number of recoloring steps required for a desired transformation can be computed in linear time for a yes-instance. We note that our results generalize the known positive ones for coloring reconfiguration.

本文言語English
ホスト出版物のタイトル29th International Symposium on Algorithms and Computation, ISAAC 2018
編集者Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ページ37:1-37:13
ISBN(電子版)9783959770941
DOI
出版ステータスPublished - 2018 12 1
イベント29th International Symposium on Algorithms and Computation, ISAAC 2018 - Jiaoxi, Yilan, Taiwan, Province of China
継続期間: 2018 12 162018 12 19

出版物シリーズ

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

Conference

Conference29th International Symposium on Algorithms and Computation, ISAAC 2018
CountryTaiwan, Province of China
CityJiaoxi, Yilan
Period18/12/1618/12/19

ASJC Scopus subject areas

  • Software

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

引用スタイル