Fast Distributed Algorithms for Brooks–Vizing Colorings

Let G be a Δ-regular graph with n vertices and girth at least 4 such that Δ⪢logn. We give very simple, randomized, distributed algorithms for vertex coloring G with Δ/k colors in O(k+logn) communication rounds, where k=O(logΔ). The algorithm may fail or exceed the above running time, but the probabi...

Ausführliche Beschreibung