Distributed (Δ +1)-Coloring in Sublogarithmic Rounds

DOI10.1145/3178120zbMath1426.68214OpenAlexW2797253418WikidataQ130885986 ScholiaQ130885986MaRDI QIDQ4561507

No author found.

Publication date: 6 December 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3178120

zbMATH Keywords

vertex coloringdistributed networksLOCAL model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (6)

Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering ⋮ An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model ⋮ Unnamed Item ⋮ Superfast coloring in CONGEST via efficient color sampling ⋮ Distributed Graph Coloring: Fundamentals and Recent Developments ⋮ Linial for lists

This page was built for publication: Distributed (Δ +1)-Coloring in Sublogarithmic Rounds