DeepAI AI Chat
Log In Sign Up

An Optimal Decentralized (Δ+ 1)-Coloring Algorithm

by   Daniel Bertschinger, et al.
ETH Zurich

Consider the following simple coloring algorithm for a graph on n vertices. Each vertex chooses a color from {1, , Δ(G) + 1} uniformly at random. While there exists a conflicted vertex choose one such vertex uniformly at random and recolor it with a randomly chosen color. This algorithm was introduced by Bhartia et al. [MOBIHOC'16] for channel selection in WIFI-networks. We show that this algorithm always converges to a proper coloring in expected O(n logΔ) steps, which is optimal and proves a conjecture of Chakrabarty and Supinski [SOSA'20].


page 1

page 2


On a Decentralized (Δ+1)-Graph Coloring Algorithm

We consider a decentralized graph coloring model where each vertex only ...

Wave Function Collapse Coloring: A New Heuristic for Fast Vertex Coloring

In this paper, we propose a high-speed greedy sequential algorithm for t...

No additional tournaments are quasirandom-forcing

A tournament H is quasirandom-forcing if the following holds for every s...

Fewer colors for perfect simulation of proper colorings

Given a graph G and color set {1, …, k}, a proper coloring is an assignm...

Random hypergraphs and property B

In 1964 Erdős proved that (1+1)) ln(2)/4 k^2 2^k edges are sufficient to...

Gradual Weisfeiler-Leman: Slow and Steady Wins the Race

The classical Weisfeiler-Leman algorithm aka color refinement is fundame...

Explicit 3-colorings for exponential graphs

Let H=(V,E) denote a simple, undirected graph. The 3-coloring exponentia...