Efficient randomized distributed coloring in CONGEST

DOI10.1145/3406325.3451089arXiv2012.14169OpenAlexW3171180074WikidataQ130860842 ScholiaQ130860842MaRDI QIDQ6065242

Tigran Tonoyan, Yannic Maus, Fabian Kuhn, Magnús M. Halldórsson

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.14169

zbMATH Keywords

massively parallel computationCONGEST modeldeterministic vertex coloring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Optimal Message-Passing with Noisy Beeps ⋮ Improved dynamic colouring of sparse graphs ⋮ Finding a small vertex cut on distributed networks

This page was built for publication: Efficient randomized distributed coloring in CONGEST