Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
43 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improved Distributed $Δ$-Coloring (1803.03248v2)

Published 8 Mar 2018 in cs.DS and cs.DC

Abstract: We present a randomized distributed algorithm that computes a $\Delta$-coloring in any non-complete graph with maximum degree $\Delta \geq 4$ in $O(\log \Delta) + 2{O(\sqrt{\log\log n})}$ rounds, as well as a randomized algorithm that computes a $\Delta$-coloring in $O((\log \log n)2)$ rounds when $\Delta \in [3, O(1)]$. Both these algorithms improve on an $O(\log3 n/\log \Delta)$-round algorithm of Panconesi and Srinivasan~[STOC'1993], which has remained the state of the art for the past 25 years. Moreover, the latter algorithm gets (exponentially) closer to an $\Omega(\log\log n)$ round lower bound of Brandt et al.~[STOC'16].

Citations (30)

Summary

We haven't generated a summary for this paper yet.