A fully dynamic distributed algorithm for a b-coloring of graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

A fully dynamic distributed algorithm for a b-coloring of graphs

Résumé

A b-coloring of a graph G is a proper coloring of the nodes of G such that each color class contains a node that has a neighbor in all other color classes. A fully dynamic algorithm is an algorithm used to support modifications (insertion or deletion) of nodes and edges in a network. Thus, in this paper we propose a fully dynamic distributed algorithm to maintain a b-coloring of a graph when its topology evolves. This method determines a b-coloring in time O(D²) and needs O(nD) changes of colors to maintain a b-coloring of a graph, where n is the number of nodes and D is the maximum degree in the graph.
Fichier non déposé

Dates et versions

hal-00381213 , version 1 (05-05-2009)

Identifiants

  • HAL Id : hal-00381213 , version 1

Citer

Shuang Liu, Brice Effantin, H. Kheddouci. A fully dynamic distributed algorithm for a b-coloring of graphs. The 2008 IEEE International Symposium on Advances in Parallel and Distributed Computing Techniques (APDCT-08), 2008, Sydney, Australia. ⟨hal-00381213⟩
52 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More