Self-stabilizing Vertex Coloring of Arbitrary Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

Self-stabilizing Vertex Coloring of Arbitrary Graphs

Résumé

A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit exception handler of backward recovery. The vertex coloration problem consists in ensuring that every node in the system has a color that is different from any of its neighbors. We provide three self-stabilizing solutions to the vertex coloration problem under unfair scheduling that are based on a greedy technique. We use at most $B+1$ different colors (in complete graphs), where $B$ is the graph degree, and ensure stabilization within $O(n\times B)$ processor atomic steps. Two of our algorithms deal with uniform networks where nodes do not have identifiers. Our solutions lead to directed acyclic orientation and maximal independent set construction at no additional cost.
Fichier principal
Vignette du fichier
color.pdf (248.18 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00631707 , version 1 (13-10-2011)

Identifiants

  • HAL Id : hal-00631707 , version 1

Citer

Maria Gradinariu, Sébastien Tixeuil. Self-stabilizing Vertex Coloring of Arbitrary Graphs. International conference on Principles of Distributed Systems (OPODIS 2000), Dec 2000, Paris, France. pp.55-70. ⟨hal-00631707⟩
658 Consultations
380 Téléchargements

Partager

Gmail Facebook X LinkedIn More