Distributed ∆-coloring plays hide-and-seek

DOI10.1145/3519935.3520027arXiv2110.00643OpenAlexW3210958954WikidataQ130838895 ScholiaQ130838895MaRDI QIDQ6083498

Alkida Balliu, Dennis Olivetti, Sebastian F. Brandt, Fabian Kuhn

Publication date: 8 December 2023

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

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

zbMATH Keywords

lower boundscoloringdistributed computingmaximal independent setLOCAL modelruling setround elimination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Distributed coloring of hypergraphs

This page was built for publication: Distributed ∆-coloring plays hide-and-seek