A distributed algorithm for a b-coloring of a graph

Authors:
Brice Effantin;Hamamache Kheddouci
Affiliations:
Laboratoire PRISMa, Université Lyon 1, IUT A Département Informatique, Bourg-en-Bresse, France;Laboratoire PRISMa, Université Lyon 1, IUT A Département Informatique, Bourg-en-Bresse, France
Venue:
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Year:
2006

Citing 14
Cited 4

A self-stabilizing algorithm for maximal matching

Information Processing Letters
The b-chromatic number of a graph

Discrete Applied Mathematics
Simple distributed&Dgr; + 1-coloring of graphs

Information Processing Letters
Some bounds for the b-chromatic number of a graph

Discrete Mathematics
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
On the b-Chromatic Number of Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Linear time self-stabilizing colorings

Information Processing Letters
Distributed algorithms for finding and maintaining a k-tree core in a dynamic network

Information Processing Letters
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
A distributed algorithm for constructing a minimum diameter spanning tree

Journal of Parallel and Distributed Computing
Single backup table schemes for shortest-path routing

Theoretical Computer Science - Foundations of software science and computation structures
Notes: On approximating the b-chromatic number

Discrete Applied Mathematics

Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A graph b-coloring based method for composition-oriented web services classification

ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
A new pyramidal approach for the address block location based on hierarchical graph coloring

ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition
An incremental distributed algorithm for a partial Grundy coloring of graphs

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.