DROPS

Document

DOI: 10.4230/LIPIcs.ISAAC.2022.4

Algorithms for Coloring Reconfiguration Under Recolorability Digraphs

Authors: Soichiro Fujii, Yuni Iwamasa, Kei Kimura, and Akira Suzuki

Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)

Abstract

In the k-Recoloring 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 k-coloring. This problem is known to be solvable in polynomial time if k ≤ 3, and is PSPACE-complete if k ≥ 4. In this paper, we consider a (directed) recolorability constraint on the k colors, which forbids some pairs of colors to be recolored directly. The recolorability constraint is given in terms of a digraph R, whose vertices correspond to the colors and whose arcs represent the pairs of colors that can be recolored directly. We provide algorithms for the problem based on the structure of recolorability constraints R, showing that the problem is solvable in linear time when R is a directed cycle or is in a class of multitrees.

Cite as

Soichiro Fujii, Yuni Iwamasa, Kei Kimura, and Akira Suzuki. Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{fujii_et_al:LIPIcs.ISAAC.2022.4,
  author =	{Fujii, Soichiro and Iwamasa, Yuni and Kimura, Kei and Suzuki, Akira},
  title =	{{Algorithms for Coloring Reconfiguration Under Recolorability Digraphs}},
  booktitle =	{33rd International Symposium on Algorithms and Computation (ISAAC 2022)},
  pages =	{4:1--4:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-258-7},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{248},
  editor =	{Bae, Sang Won and Park, Heejin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.4},
  URN =		{urn:nbn:de:0030-drops-172896},
  doi =		{10.4230/LIPIcs.ISAAC.2022.4},
  annote =	{Keywords: combinatorial reconfiguration, graph coloring, recolorability, recoloring}
}

Search Results

Documents authored by Fujii, Soichiro

Algorithms for Coloring Reconfiguration Under Recolorability Digraphs

Abstract

Cite as

Thanks for your feedback!

Could not send message