On the Complexity of Distributed Graph Coloring with Local Minimality Constraints

Cyril Gavoille (1, 2) , Ralf Klasing (1, 2) , Adrian Kosowski (1, 2, 3) , Łukasz Kuszner (3) , Alfredo Navarra (4)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
3 Gdansk University of Technology - Department of Algorithms and Systems Modelling [ETI GUT]
4 DMI - Dipartimento di Matematica e Informatica [Perugia]

Domaines: Autre [cs.OH]

Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Łukasz Kuszner, Alfredo Navarra. On the Complexity of Distributed Graph Coloring with Local Minimality Constraints. Networks, 2009, 54 (1), pp.12--19. ⟨10.1002/net.20293⟩. ⟨hal-00342898⟩