License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2020.39
URN: urn:nbn:de:0030-drops-131170
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13117/
Halldórsson, Magnús M. ;
Kuhn, Fabian ;
Maus, Yannic ;
Nolin, Alexandre
Coloring Fast Without Learning Your Neighbors' Colors
Abstract
We give an improved randomized CONGEST algorithm for distance-2 coloring that uses Δ²+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(√{log log n})}.
BibTeX - Entry
@InProceedings{halldrsson_et_al:LIPIcs:2020:13117,
author = {Magn{\'u}s M. Halld{\'o}rsson and Fabian Kuhn and Yannic Maus and Alexandre Nolin},
title = {{Coloring Fast Without Learning Your Neighbors' Colors}},
booktitle = {34th International Symposium on Distributed Computing (DISC 2020)},
pages = {39:1--39:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-168-9},
ISSN = {1868-8969},
year = {2020},
volume = {179},
editor = {Hagit Attiya},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13117},
URN = {urn:nbn:de:0030-drops-131170},
doi = {10.4230/LIPIcs.DISC.2020.39},
annote = {Keywords: distributed graph coloring, distance 2 coloring, congestion}
}
Keywords: |
|
distributed graph coloring, distance 2 coloring, congestion |
Collection: |
|
34th International Symposium on Distributed Computing (DISC 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
07.10.2020 |