Distributed Recoloring

by   Marthe Bonamy, et al.

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.


page 1

page 2

page 3

page 4


A Distributed Palette Sparsification Theorem

Is fully decentralized graph streaming possible? We consider this questi...

Target Set in Threshold Models

Consider a graph G and an initial coloring, where each node is blue or r...

Distributed coloring in sparse graphs with fewer colors

This paper is concerned with efficiently coloring sparse graphs in the d...

Locality of not-so-weak coloring

Many graph problems are locally checkable: a solution is globally feasib...

Hardness of minimal symmetry breaking in distributed computing

A graph is weakly 2-colored if the nodes are labeled with colors black a...

Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs

Graph coloring, also known as vertex coloring, considers the problem of ...

Distributed Reconfiguration of Maximal Independent Sets

Consider the following problem: given a graph and two maximal independen...

Please sign up or login with your details

Forgot password? Click here to reset