Distributed Recoloring

Given two colorings of a graph, we consider the following problem: can we recolor the graph from one coloring to the other through a series of elementary changes, such that the graph is properly colored after each step? We introduce the notion of distributed recoloring: The input graph represents a network of computers that needs to be recolored. Initially, each node is aware of its own input color and target color. The nodes can exchange messages with each other, and eventually each node has to stop and output its own recoloring schedule, indicating when and how the node changes its color. The recoloring schedules have to be globally consistent so that the graph remains properly colored at each point, and we require that adjacent nodes do not change their colors simultaneously. We are interested in the following questions: How many communication rounds are needed (in the LOCAL model of distributed computing) to find a recoloring schedule? What is the length of the recoloring schedule? And how does the picture change if we can use extra colors to make recoloring easier? The main contributions of this work are related to distributed recoloring with one extra color in the following graph classes: trees, $3$-regular graphs, and toroidal grids.

[1]  A. Kempe.  On the Geographical Problem of the Four Colours , 1879 .

[2]  Tsvi Kopelowitz,et al.  An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model , 2019, SIAM J. Comput..

[3]  M. Kaufmann.  What Can Be Computed Locally ? , 2003 .

[4]  Daniel C. McDonald.  Connectedness and Hamiltonicity of graphs on vertex colorings , 2015 .

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

[6]  Mark Jerrum,et al.  A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.

[7]  Marthe Bonamy,et al.  Distributed Coloring in Sparse Graphs with Fewer Colors , 2018, PODC.

[8]  Paul S. Bonsma,et al.  The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration , 2014, IPEC.

[9]  Patric R. J. Östergård,et al.  LCL Problems on Grids , 2017, PODC.

[10]  Marthe Bonamy,et al.  Recoloring graphs via tree decompositions , 2014, Eur. J. Comb..

[11]  Leonid Barenboim,et al.  Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks , 2016, J. ACM.

[12]  Aravind Srinivasan,et al.  The local nature of Δ-coloring and its algorithmic applications , 1995, Comb..

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

[14]  Jan van den Heuvel,et al.  Mixing 3-colourings in bipartite graphs , 2007, Eur. J. Comb..

[15]  Leonid Barenboim,et al.  Distributed Graph Coloring: Fundamentals and Recent Developments , 2013, Distributed Graph Coloring: Fundamentals and Recent Developments.

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

[17]  Leonid Barenboim.  Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks , 2015, PODC.

[18]  J. Reif,et al.  Parallel Tree Contraction Part 1: Fundamentals , 1989, Adv. Comput. Res..

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

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

[21]  Aravind Srinivasan,et al.  Improved distributed algorithms for coloring and network decomposition problems , 1992, STOC '92.

[22]  Seth Pettie,et al.  An optimal distributed (Δ+1)-coloring algorithm? , 2018, STOC.

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

[24]  Nicolas Bousquet,et al.  Fast Recoloring of Sparse Graphs , 2014, Eur. J. Comb..

[25]  Daniël Paulusma,et al.  A Reconfigurations Analogue of Brooks' Theorem and Its Consequences , 2016, J. Graph Theory.