Distributed Δ-Coloring Plays Hide-and-Seek

by   Alkida Balliu, et al.

We prove several new tight distributed lower bounds for classic symmetry breaking graph problems. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a Δ-coloring on Δ-regular trees requires Ω(log_Δ n) rounds and any randomized algorithm requires Ω(log_Δlog n) rounds. We prove this result by showing that a natural relaxation of the Δ-coloring problem is a fixed point in the round elimination framework. As a first application, we show that our Δ-coloring lower bound proof directly extends to arbdefective colorings. We exactly characterize which variants of the arbdefective coloring problem are "easy", and which of them instead are "hard". As a second application, which we see as our main contribution, we use the structure of the fixed point as a building block to prove lower bounds as a function of Δ for a large class of distributed symmetry breaking problems. For example, we obtain a tight lower bound for the fundamental problem of computing a (2,β)-ruling set. This is an exponential improvement over the best existing lower bound for the problem, which was proven in [FOCS '20]. Our lower bound even applies to a much more general family of problems that allows for almost arbitrary combinations of natural constraints from coloring problems, orientation problems, and independent set problems, and provides a single unified proof for known and new lower bound results for these types of problems. Our lower bounds as a function of Δ also imply lower bounds as a function of n. We obtain, for example, that maximal independent set, on trees, requires Ω(log n / loglog n) rounds for deterministic algorithms, which is tight.


page 1

page 2

page 3

page 4


Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees

Recently, Balliu, Brandt, and Olivetti [FOCS '20] showed the first ω(log...

Hardness of minimal symmetry breaking in distributed computing

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

One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks

The paper compares two generic techniques for deriving lower bounds and ...

A Stress-Free Sum-of-Squares Lower Bound for Coloring

We prove that with high probability over the choice of a random graph G ...

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs

We investigate the distributed complexity of maximal matching and maxima...

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics

We study connections between distributed local algorithms, finitary fact...

The Complexity of Symmetry Breaking in Massive Graphs

The goal of this paper is to understand the complexity of symmetry break...

Please sign up or login with your details

Forgot password? Click here to reset