Ghaffari, Mohsen ;
Lymouri, Christiana
Simple and NearOptimal Distributed Coloring for Sparse Graphs
Abstract
Graph coloring is one of the central problems in distributed graph algorithms. Much of the research on this topic has focused on coloring with Delta+1 colors, where Delta denotes the maximum degree. Using Delta+1 colors may be unsatisfactory in sparse graphs, where not all nodes have such a high degree; it would be more desirable to use a number of colors that improves with sparsity. A standard measure that captures sparsity is arboricity, which is the smallest number of forests into which the edges of the graph can be partitioned.
We present simple randomized distributed algorithms that, with high probability, color any nnode alphaarboricity graph:
 using (2+epsilon)alpha colors, for constant epsilon>0, in O(log n) rounds, if alpha=Omega(log n log log n), or
 using O(alpha log alpha) colors, in O(log n) rounds, or
 using O(alpha) colors, in O(log n min{log log n, log alpha}) rounds.
These algorithms are nearlyoptimal, as it is known by results of Linial [FOCS'87] and Barenboim and Elkin [PODC'08] that coloring with Theta(alpha) colors, or even poly(alpha) colors, requires Omega(log_alpha n) rounds. The previously bestknown O(log n)time result was a deterministic algorithm due to Barenboim and Elkin [PODC'08], which uses Theta(alpha^2) colors. Barenboim and Elkin stated improving this number of colors as an open problem in their Distributed Graph Coloring Book.
BibTeX  Entry
@InProceedings{ghaffari_et_al:LIPIcs:2017:8017,
author = {Mohsen Ghaffari and Christiana Lymouri},
title = {{Simple and NearOptimal Distributed Coloring for Sparse Graphs}},
booktitle = {31st International Symposium on Distributed Computing (DISC 2017)},
pages = {20:120:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770538},
ISSN = {18688969},
year = {2017},
volume = {91},
editor = {Andr{\'e}a W. Richa},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8017},
URN = {urn:nbn:de:0030drops80178},
doi = {10.4230/LIPIcs.DISC.2017.20},
annote = {Keywords: Distributed Graph Algorithms, Graph Coloring, Arboricity}
}
2017
Keywords: 

Distributed Graph Algorithms, Graph Coloring, Arboricity 
Seminar: 

31st International Symposium on Distributed Computing (DISC 2017)

Issue date: 

2017 
Date of publication: 

2017 