DeepAI AI Chat
Log In Sign Up

Improved Deterministic (Δ+1)-Coloring in Low-Space MPC

by   Artur Czumaj, et al.
Weizmann Institute of Science
Institute of Science and Technology Austria
University of Warwick

We present a deterministic O(logloglog n)-round low-space Massively Parallel Computation (MPC) algorithm for the classical problem of (Δ+1)-coloring on n-vertex graphs. In this model, every machine has a sublinear local memory of size n^ϕ for any arbitrary constant ϕ∈ (0,1). Our algorithm works under the relaxed setting where each machine is allowed to perform exponential (in n^ϕ) local computation, while respecting the n^ϕ space and bandwidth limitations. Our key technical contribution is a novel derandomization of the ingenious (Δ+1)-coloring LOCAL algorithm by Chang-Li-Pettie (STOC 2018, SIAM J. Comput. 2020). The Chang-Li-Pettie algorithm runs in T_local=poly(loglog n) rounds, which sets the state-of-the-art randomized round complexity for the problem in the local model. Our derandomization employs a combination of tools, most notably pseudorandom generators (PRG) and bounded-independence hash functions. The achieved round complexity of O(logloglog n) rounds matches the bound of log(T_local), which currently serves an upper bound barrier for all known randomized algorithms for locally-checkable problems in this model. Furthermore, no deterministic sublogarithmic low-space MPC algorithms for the (Δ+1)-coloring problem were previously known.


page 1

page 2

page 3

page 4


Simple, Deterministic, Constant-Round Coloring in the Congested Clique

We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring p...

Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs

We consider the problem of designing deterministic graph algorithms for ...

On the Hardness of Massively Parallel Computation

We investigate whether there are inherent limits of parallelization in t...

Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation

We present a very simple randomized partitioning procedure for graph col...

An Optimal Distributed (Δ+1)-Coloring Algorithm?

Vertex coloring is one of the classic symmetry breaking problems studied...

A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique

In this paper, we show that the Minimum Spanning Tree problem can be sol...

Derandomizing the Lovasz Local Lemma via log-space statistical tests

The Lovász Local Lemma (LLL) is a keystone principle in probability theo...