Shortest Reconfiguration of Colorings Under Kempe Changes

A k-coloring of a graph maps each vertex of the graph to a color in {1, 2, . . . , k}, such that no two adjacent vertices receive the same color. Given a k-coloring of a graph, a Kempe change produces a new k-coloring by swapping the colors in a bicolored connected component. We investigate the complexity of finding the smallest number of Kempe changes needed to transform a given k-coloring into another given k-coloring. We show that this problem admits a polynomial-time dynamic programming algorithm on path graphs, which turns out to be highly non-trivial. Furthermore, the problem is NP-hard even on star graphs and we show that on such graphs it admits a constant-factor approximation algorithm and is fixed-parameter tractable when parameterized by the number k of colors. The hardness result as well as the algorithmic results are based on the notion of a canonical transformation. 2012 ACM Subject Classification Mathematics of computing → Graph algorithms

[1]  Daniël Paulusma,et al.  Finding Shortest Paths Between Graph Colourings , 2014, Algorithmica.

[2]  Jan van den Heuvel,et al.  Finding paths between 3‐colorings , 2011, IWOCA.

[3]  Yota Otachi,et al.  Swapping Colored Tokens on Graphs , 2015, WADS.

[4]  Daniël Paulusma,et al.  Kempe equivalence of colourings of cubic graphs , 2015, Eur. J. Comb..

[5]  Erik D. Demaine,et al.  Sequentially Swapping Colored Tokens on Graphs , 2017, WALCOM.

[6]  Naomi Nishimura,et al.  Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas , 2015, ICALP.

[7]  Alexander Pilz,et al.  Flip Distance Between Triangulations of a Simple Polygon is NP-Complete , 2015, Discret. Comput. Geom..

[8]  Marthe Bonamy,et al.  Diameter of Colorings Under Kempe Changes , 2019, COCOON.

[9]  B. Mohar,et al.  On the non-ergodicity of the Swendsen–Wang–Kotecký algorithm on the kagomé lattice , 2010, 1002.4279.

[10]  Bojan Mohar,et al.  A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm , 2009, 0901.1010.

[11]  Luke Postle,et al.  Improved Bounds for Randomly Sampling Colorings via Linear Programming , 2018, SODA.

[12]  Oded Goldreich.  Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard , 2011, Studies in Complexity and Cryptography.

[13]  Paul S. Bonsma,et al.  Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances , 2007, Theor. Comput. Sci..

[14]  Vinayak Pathak,et al.  Flip Distance Between Two Triangulations of a Point Set is NP-complete , 2012, CCCG.

[15]  Eric Vigoda,et al.  Improved bounds for sampling colorings , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[16]  Manfred K. Warmuth,et al.  Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable , 1986, AAAI.

[17]  B. Mohar.  Kempe Equivalence of Colorings , 2006 .

[18]  Tillmann Miltzow,et al.  Complexity of Token Swapping and Its Variants , 2016, Algorithmica.

[19]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[20]  Nicolas Bousquet,et al.  A polynomial version of Cereceda's conjecture , 2019, J. Comb. Theory B.

[21]  Erik D. Demaine,et al.  Solving the Rubik's Cube Optimally is NP-complete , 2017, STACS.

[22]  Yoshio Okamoto,et al.  Approximation and Hardness for Token Swapping , 2016 .

[23]  Henry Meyniel,et al.  Les 5-colorations d'un graphe planaire forment une classe de commutation unique , 1978, J. Comb. Theory B.

[24]  Marthe Bonamy,et al.  On a conjecture of Mohar concerning Kempe equivalence of regular graphs , 2015, J. Comb. Theory B.

[25]  Jan van den Heuvel,et al.  The complexity of change , 2013, Surveys in Combinatorics.

[26]  Michel Las Vergnas,et al.  Kempe classes and the Hadwiger Conjecture , 1981, J. Comb. Theory B.

[27]  Naomi Nishimura,et al.  Introduction to Reconfiguration , 2018, Algorithms.