Faster Deterministic Distributed Coloring Through Recursive List Coloring

DOI10.1137/1.9781611975994.76OpenAlexW3000828483MaRDI QIDQ5146848

Fabian Kuhn

Publication date: 2 February 2021

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

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (6)

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering ⋮ Improved distributed \(\Delta\)-coloring ⋮ Distributed coloring and the local structure of unit-disk graphs ⋮ Distributed backup placement ⋮ Linial for lists

This page was built for publication: Faster Deterministic Distributed Coloring Through Recursive List Coloring