A Distributed Algorithm for a b-Coloring of a Graph

Brice Effantin (1) , Hamamache Kheddouci (1)

1 LIESP - Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production

A b-coloring of a graph is a proper coloring where each color admits at least one node (called dominating node) adjacent to every other used color. Such a coloring gives a partitioning of the graph in clusters for which every cluster has a clusterhead (the dominating node) adjacent to each other cluster. Such a decomposition is very interesting for large distributed systems, networks,... In this paper we present a distributed algorithm to compute a b-coloring of a graph, and we propose an application for the routing in networks to illustrate our algorithm.

Domaines: Algorithme et structure de données [cs.DS]

Brice Effantin, Hamamache Kheddouci. A Distributed Algorithm for a b-Coloring of a Graph. 4th International Symposium on Parallel and Distributed Processing and Applications, Dec 2006, Sorrento, Italy. pp.430-438. ⟨hal-00171173⟩