DeepAI AI Chat
Log In Sign Up

Near-Optimal Distributed Degree+1 Coloring

12/01/2021
by   Magnus M. Halldorsson, et al.
0

We present a new approach to randomized distributed graph coloring that is simpler and more efficient than previous ones. In particular, it allows us to tackle the (deg+1)-list-coloring (D1LC) problem, where each node v of degree d_v is assigned a palette of d_v+1 colors, and the objective is to find a proper coloring using these palettes. While for (Δ+1)-coloring (where Δ is the maximum degree), there is a fast randomized distributed O(log^3log n)-round algorithm (Chang, Li, and Pettie [SIAM J. Comp. 2020]), no o(log n)-round algorithms are known for the D1LC problem. We give a randomized distributed algorithm for D1LC that is optimal under plausible assumptions about the deterministic complexity of the problem. Using the recent deterministic algorithm of Ghaffari and Kuhn [FOCS2021], our algorithm runs in O(log^3 log n) time, matching the best bound known for (Δ+1)-coloring. In addition, it colors all nodes of degree Ω(log^7 n) in O(log^* n) rounds. A key contribution is a subroutine to generate slack for D1LC. When placed into the framework of Assadi, Chen, and Khanna [SODA2019] and Alon and Assadi [APPROX/RANDOM2020], this almost immediately leads to a palette sparsification theorem for D1LC, generalizing previous results. That gives fast algorithms for D1LC in three different models: an O(1)-round algorithm in the MPC model with Õ(n) memory per machine; a single-pass semi-streaming algorithm in dynamic streams; and an Õ(n√(n))-time algorithm in the standard query model.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/13/2020

Distance-2 Coloring in the CONGEST Model

We give efficient randomized and deterministic distributed algorithms fo...
12/05/2019

Efficient Deterministic Distributed Coloring with Small Bandwidth

We show that the (degree+1)-list coloring problem can be solved determin...
07/22/2022

Fault Tolerant Coloring of the Asynchronous Cycle

We present a wait-free algorithm for proper coloring the n nodes of the ...
08/10/2020

Coloring Fast Without Learning Your Neighbors' Colors

We give an improved randomized CONGEST algorithm for distance-2 coloring...
12/20/2022

Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms

In recent years, there has been a growing interest in solving various gr...
11/06/2017

On Derandomizing Local Distributed Algorithms

The gap between the known randomized and deterministic local distributed...
12/06/2022

Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model

We consider the LOCAL model of distributed computing, where in a single ...