Coloring Fast Without Learning Your Neighbors' Colors

08/10/2020
by   Magnus M. Halldorsson, et al.
0

We give an improved randomized CONGEST algorithm for distance-2 coloring that uses Δ^2+1 colors and runs in O(log n) rounds, improving the recent O(logΔ·log n)-round algorithm in [Halldórsson, Kuhn, Maus; PODC '20]. We then improve the time complexity to O(logΔ) + 2^O(√(loglog n)).

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset