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

Authors

page 1

page 2

page 3

page 4

05/13/2020

Distance-2 Coloring in the CONGEST Model

We give efficient randomized and deterministic distributed algorithms fo...
02/08/2021

Superfast Coloring in CONGEST via Efficient Color Sampling

We present a procedure for efficiently sampling colors in the model. It...
06/23/2021

Distributed coloring and the local structure of unit-disk graphs

Coloring unit-disk graphs efficiently is an important problem in the glo...
12/10/2019

A Fast Self-correcting π Algorithm

We have rediscovered a simple algorithm to compute the mathematical cons...
12/01/2021

Near-Optimal Distributed Degree+1 Coloring

We present a new approach to randomized distributed graph coloring that ...
01/27/2021

Harvest: A Reliable and Energy Efficient Bulk Data Collection Service for Large Scale Wireless Sensor Networks

We present a bulk data collection service, Harvest, for energy constrain...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.