Superfast Coloring in CONGEST via Efficient Color Sampling

by   Magnus M. Halldorsson, et al.

We present a procedure for efficiently sampling colors in the model. It allows nodes whose number of colors exceeds their number of neighbors by a constant fraction to sample up to Θ(log n) semi-random colors unused by their neighbors in O(1) rounds, even in the distance-2 setting. This yields algorithms with O(log^* Δ) complexity for different edge-coloring, vertex coloring, and distance-2 coloring problems, matching the best possible. In particular, we obtain an O(log^* Δ)-round CONGEST algorithm for (1+ϵ)Δ-edge coloring when Δ≥log^1+1/log^*n n, and a poly(loglog n)-round algorithm for (2Δ-1)-edge coloring in general. The sampling procedure is inspired by a seminal result of Newman in communication complexity.



page 1

page 2

page 3

page 4


Coloring Fast Without Learning Your Neighbors' Colors

We give an improved randomized CONGEST algorithm for distance-2 coloring...

Distance-2 Coloring in the CONGEST Model

We give efficient randomized and deterministic distributed algorithms fo...

Distributed coloring and the local structure of unit-disk graphs

Coloring unit-disk graphs efficiently is an important problem in the glo...

Equal Area Breaks: A Classification Scheme for Data to Obtain an Evenly-colored Choropleth Map

An efficient algorithm for computing the choropleth map classification s...

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...

Local Conflict Coloring Revisited: Linial for Lists

Linial's famous color reduction algorithm reduces a given m-coloring of ...
This week in AI

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