Distributed Coloring in Sparse Graphs with Fewer Colors

DOI10.1145/3212734.3212740zbMath1428.68362arXiv1802.05582OpenAlexW2962804769MaRDI QIDQ5197707

Marthe Bonamy, Louis Esperet, Pierre Aboulker, Nicolas Bousquet

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/1802.05582

zbMATH Keywords

graph coloringdistributed algorithmmaximum average degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (3)

Improved distributed \(\Delta\)-coloring ⋮ Distributed Recoloring ⋮ Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs

This page was built for publication: Distributed Coloring in Sparse Graphs with Fewer Colors