Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model

DOI10.1137/1.9781611975482.49zbMath1431.68130arXiv1804.00137OpenAlexW2796189574MaRDI QIDQ5236232

Shiri Chechik, Doron Mukhtar

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (3)

Improved distributed \(\Delta\)-coloring ⋮ Distributed coloring in sparse graphs with fewer colors ⋮ Local mending

This page was built for publication: Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model