Locality of not-so-weak coloring

04/11/2019
by   Alkida Balliu, et al.
0

Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and Stockmeyer (1995). Recently, Chang et al. (2016) showed that in bounded-degree graphs, every LCL problem belongs to one of the following classes: - "Easy": solvable in O(^* n) rounds with both deterministic and randomized distributed algorithms. - "Hard": requires at least Ω( n) rounds with deterministic and Ω( n) rounds with randomized distributed algorithms. Hence for any parameterized LCL problem, when we move from local problems towards global problems, there is some point at which complexity suddenly jumps from easy to hard. For example, for vertex coloring in d-regular graphs it is now known that this jump is at precisely d colors: coloring with d+1 colors is easy, while coloring with d colors is hard. However, it is currently poorly understood where this jump takes place when one looks at defective colorings. To study this question, we define k-partial c-coloring as follows: nodes are labeled with numbers between 1 and c, and every node is incident to at least k properly colored edges. It is known that 1-partial 2-coloring (a.k.a. weak 2-coloring) is easy for any d > 1. As our main result, we show that k-partial 2-coloring becomes hard as soon as k > 2, no matter how large a d we have. We also show that this is fundamentally different from k-partial 3-coloring: no matter which k > 3 we choose, the problem is always hard for d = k but it becomes easy when d ≫ k. The same was known previously for partial c-coloring with c > 4, but the case of c < 4 was open.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/02/2019

Towards the Locality of Vizing's Theorem

Vizing showed that it suffices to color the edges of a simple graph usin...
research
05/07/2018

(Δ+1) Coloring in the Congested Clique Model

In this paper, we present improved algorithms for the (Δ+1) (vertex) col...
research
11/05/2018

Hardness of minimal symmetry breaking in distributed computing

A graph is weakly 2-colored if the nodes are labeled with colors black a...
research
08/31/2022

Making Self-Stabilizing any Locally Greedy Problem

We propose a way to transform synchronous distributed algorithms solving...
research
09/12/2022

Mending Partial Solutions with Few Changes

In this paper, we study the notion of mending, i.e. given a partial solu...
research
02/18/2019

How much does randomness help with locally checkable problems?

Locally checkable labeling problems (LCLs) are distributed graph problem...
research
02/19/2018

Distributed Recoloring

Given two colorings of a graph, we consider the following problem: can w...

Please sign up or login with your details

Forgot password? Click here to reset