An Optimal Decentralized (∆ + 1)-Coloring Algorithm
OPEN ACCESS
Author / Producer
Date
2020
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
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 de Supinski [SOSA'20].
Permanent link
Publication status
published
External links
Book title
28th Annual European Symposium on Algorithms (ESA 2020)
Volume
173
Pages / Article No.
17
Publisher
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Event
28th Annual European Symposium on Algorithms (ESA 2020) (virtual)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Decentralized Algorithm; Distributed Computing; Graph Coloring; Randomized Algorithms
Organisational unit
03672 - Steger, Angelika (emeritus) / Steger, Angelika (emeritus)
03457 - Welzl, Emo (emeritus) / Welzl, Emo (emeritus)
Notes
Due to the Coronavirus (COVID-19) the conference was conducted virtually.
Funding
169242 - Saturation Games and Robust Random Structures (SNF)