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

09/13/2020
by   Artur Czumaj, et al.
0

We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18). A remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space. We also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(logΔ + loglog n) rounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2019

Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space

The Massively Parallel Computation (MPC) model is an emerging model whic...
research
12/10/2021

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

We present a deterministic O(logloglog n)-round low-space Massively Para...
research
08/25/2018

Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation

We present a very simple randomized partitioning procedure for graph col...
research
06/01/2023

Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem

In this work, we present a constant-round algorithm for the 2-ruling set...
research
03/08/2018

Improved Distributed Δ-Coloring

We present a randomized distributed algorithm that computes a Δ-coloring...
research
02/28/2018

Brief Announcement: Semi-MapReduce Meets Congested Clique

Graph problems are troublesome when it comes to MapReduce. Typically, to...
research
07/30/2020

Local Conflict Coloring Revisited: Linial for Lists

Linial's famous color reduction algorithm reduces a given m-coloring of ...

Please sign up or login with your details

Forgot password? Click here to reset