Skip to Main content Skip to Navigation

On the Complexity of Distributed Graph Coloring with Local Minimality Constraints

Abstract : Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. Given an order among the colors, a coloring is said to be "greedy" if there does not exist a vertex for which its associated color can be replaced by a color of lower position in the fixed order without violating the property that neighbouring vertices must receive different colors. We consider the problems of "Greedy Coloring" and "Largest First Coloring" (a variant of greedy coloring with strengthened constraints) in the Linial model of distributed computation, providing lower and upper bounds and a comparison to the "$(\Delta+1)$-Coloring" and "Maximal Independent Set" problems, with $\Delta$ being the maximum vertex degree in G.
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Thursday, December 20, 2007 - 4:24:21 PM
Last modification on : Saturday, June 25, 2022 - 10:30:17 AM
Long-term archiving on: : Monday, June 27, 2011 - 5:37:23 PM


Files produced by the author(s)


  • HAL Id : inria-00200127, version 2



Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Łukasz Kuszner, Alfredo Navarra. On the Complexity of Distributed Graph Coloring with Local Minimality Constraints. [Research Report] RR-6399, INRIA. 2007. ⟨inria-00200127v2⟩



Record views


Files downloads