Distributed Delta-Coloring under Bandwidth Limitations
<|reference_start|>Distributed Delta-Coloring under Bandwidth Limitations: We consider the problem of coloring graphs of maximum degree $\Delta$ with $\Delta$ colors in the distributed setting with limited bandwidth. Specifically, we give a $\mathsf{poly}\log\log n$-round randomized algorithm in the CONGEST model. This is close to the lower bound of $\Omega(\log \log n)$ rounds from [Brandt et al., STOC '16], which holds also in the more powerful LOCAL model. The core of our algorithm is a reduction to several special instances of the constructive Lov\'asz local lemma (LLL) and the $deg+1$-list coloring problem.<|reference_end|>
@article{maus2024distributed,
    title={Distributed Delta-Coloring under Bandwidth Limitations},
    author={Yannic Maus, Magn'us M. Halld'orsson},
    journal={arXiv preprint arXiv:2405.09975},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.09975},
    primaryClass={cs.DS cs.DC}
}