Efficient Deterministic Distributed Coloring with Small Bandwidth

DOI10.1145/3382734.3404504OpenAlexW3046763033MaRDI QIDQ5855242

Philipp Bamberger, Fabian Kuhn, Yannic Maus

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

massively parallel computationCONGEST modeldeterministic vertex coloring

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (7)

Network Decomposition and Distributed Derandomization (Invited Paper) ⋮ Distributed Testing of Distance-k Colorings ⋮ Deterministic Massively Parallel Connectivity ⋮ Distributed Symmetry Breaking on Power Graphs via Sparsification ⋮ Robustness: a new form of heredity motivated by dynamic networks ⋮ Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC ⋮ Linial for lists

This page was built for publication: Efficient Deterministic Distributed Coloring with Small Bandwidth