Locally-Iterative Distributed (Δ+ 1)

DOI10.1145/3212734.3212769zbMath1428.68365arXiv1712.00285OpenAlexW2963238998MaRDI QIDQ5197709

Uri Goldenberg, Leonid Barenboim, Michael Elkin

Publication date: 19 September 2019

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

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

zbMATH Keywords

coloringmaximal matchingmaximal independent set

Mathematics Subject Classification ID

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

Related Items (8)

Distributed reconfiguration of maximal independent sets ⋮ Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering ⋮ An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model ⋮ Improved distributed \(\Delta\)-coloring ⋮ Unnamed Item ⋮ A topological perspective on distributed network algorithms ⋮ Distributed Reconfiguration of Maximal Independent Sets ⋮ Linial for lists

This page was built for publication: Locally-Iterative Distributed (Δ+ 1)