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… (More)
DOI: 10.1002/net.20293

Topics

3 Figures and Tables

Cite this paper

@article{Gavoille2009OnTC, title={On the complexity of distributed graph coloring with local minimality constraints}, author={Cyril Gavoille and Ralf Klasing and Adrian Kosowski and Lukasz Kuszner and Alfredo Navarra}, journal={Networks}, year={2009}, volume={54}, pages={12-19} }