A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Distance-2 Coloring in the CONGEST Model
[article]
2020
arXiv
pre-print
We give efficient randomized and deterministic distributed algorithms for computing a distance-2 vertex coloring of a graph G in the CONGEST model. In particular, if Δ is the maximum degree of G, we show that there is a randomized CONGEST model algorithm to compute a distance-2 coloring of G with Δ^2+1 colors in O(logΔ·log n) rounds. Further if the number of colors is slightly increased to (1+ϵ)Δ^2 for some ϵ>1/ polylog(n), we show that it is even possible to compute a distance-2 coloring
arXiv:2005.06528v1
fatcat:erk36zl335fuzfuskax6x42gna