Efficient Randomized Distributed Coloring in CONGEST
Magn\'us M. Halld\'orsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan

TL;DR
This paper introduces a new randomized distributed vertex coloring algorithm in the CONGEST model that significantly improves the round complexity for graphs with large maximum degree, achieving near-logarithmic bounds.
Contribution
It presents the first efficient CONGEST algorithm for $( ext{max degree}+1)$-list coloring with polylogarithmic rounds, surpassing previous results limited to the LOCAL model.
Findings
Achieves $( ext{max degree}+1)$-list coloring in $O( ext{log}^5 ext{log} n)$ rounds in CONGEST.
Improves upon the previous $O( ext{log} ext{max degree} + ext{log}^6 ext{log} n)$ rounds algorithm.
Demonstrates exponential speedup for large maximum degree graphs.
Abstract
Distributed vertex coloring is one of the classic problems and probably also the most widely studied problems in the area of distributed graph algorithms. We present a new randomized distributed vertex coloring algorithm for the standard CONGEST model, where the network is modeled as an -node graph , and where the nodes of operate in synchronous communication rounds in which they can exchange -bit messages over all the edges of . For graphs with maximum degree , we show that the -list coloring problem (and therefore also the standard -coloring problem) can be solved in rounds. Previously such a result was only known for the significantly more powerful LOCAL model, where in each round, neighboring nodes can exchange messages of arbitrary size. The best previous -coloring algorithm in the CONGEST model…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
