Maxime Flin

Maxime Flin, Magnús M. Halldórsson, Manuel Jakob et al.

For any $Δ$, let $k_Δ$ be the maximum integer $k$ such that $(k+1)(k+2)\le Δ$. We give a distributed \LOCAL algorithm that, given an integer $k < k_Δ$, computes a valid $Δ-k$-coloring if one exists. The algorithm runs in $\tilde{O}(\log^4 \log n)$ rounds, which is within a polynomial factor of the $Ω(\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_Δ$, the problem requires $Ω(n/Δ)$ distributed rounds [Molloy, Reed, '14, Bamas, Esperet '19]. For $Δ$ at most polylogarithmic, the algorithm is an exponential improvement over the current state of the art of $O(\log^{49/12} n)$ rounds. When $Δ\ge (\log n)^{50}$, our algorithm achieves an even faster runtime of $O(\log^* n)$ rounds.

Maxime Flin, Magnús M. Halldórsson

Reed [J.~Comb.~Theory B, 1999] showed that graphs of maximum degree $Δ\geq 10^{14}$ without $Δ$-cliques are $(Δ-1)$-colorable. We design a one-pass semi-streaming algorithm for computing such a coloring. Additionally, we prove that any one-pass $(Δ-k)$-coloring algorithm for $0\leq k < (Δ+1)/2$ requires $Ω(n(k+1))$ space.