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]. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000447180Publication status
publishedExternal links
Book title
28th Annual European Symposium on Algorithms (ESA 2020)Journal / series
Leibniz International Proceedings in Informatics (LIPIcs)Volume
Pages / Article No.
Publisher
Schloss Dagstuhl - Leibniz-Zentrum für InformatikEvent
Subject
Decentralized Algorithm; Distributed Computing; Graph Coloring; Randomized AlgorithmsOrganisational unit
03672 - Steger, Angelika / Steger, Angelika
03457 - Welzl, Emo / Welzl, Emo
Funding
169242 - Saturation Games and Robust Random Structures (SNF)
Notes
Due to the Coronavirus (COVID-19) the conference was conducted virtually.More
Show all metadata
ETH Bibliography
yes
Altmetrics