Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors

TL;DR

This paper presents a distributed algorithm for vertex coloring that operates in sublogarithmic time and achieves near-optimal number of colors, significantly improving efficiency for large graphs.

Contribution

The authors introduce a new distributed algorithm that computes near-optimal vertex colorings in sublogarithmic rounds, improving upon previous methods especially for large maximum degrees.

Findings

Runs in O(\u2113^4 \u211d log n) rounds for certain parameters

Achieves exponential speedup over previous algorithms for t polylogarithmic t

Matches lower bounds, showing optimality in certain regimes

Abstract

For any $\Delta$, let $k_\Delta$ be the maximum integer $k$ such that $(k+1)(k+2)\le \Delta$. We give a distributed \LOCAL algorithm that, given an integer $k < k_\Delta$, computes a valid $\Delta-k$-coloring if one exists. The algorithm runs in $\tilde{O}(\log^4 \log n)$ rounds, which is within a polynomial factor of the $\Omega(\log\log n)$ lower bound, which already applies to the case $k=0$. It is also best possible in the sense that if $k \ge k_\Delta$, the problem requires $\Omega(n/\Delta)$ distributed rounds [Molloy, Reed, '14, Bamas, Esperet '19]. For $\Delta$ at most polylogarithmic, the algorithm is an exponential improvement over the current state of the art of $O(\log^{49/12} n)$ rounds. When $\Delta \ge (\log n)^{50}$, our algorithm achieves an even faster runtime of $O(\log^* n)$ rounds.