A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph

Résumé

The chromatic sum of a graph G is the minimum sum of colors in a vertex coloring of G. This problem has many interests like in networks, where it models the minimization of the total charge of a network. As systems are more and more large and dynamic, distributed approaches are needed to manage them. In this paper we present a selfstabilizing algorithm to determine a minimal sum of colors for a graph. Such a coloring is determined with at most O(nΔ2) changes of colors, where Δ is the maximum degree of the graph.
Fichier non déposé

Dates et versions

hal-00188342 , version 1 (16-11-2007)

Identifiants

  • HAL Id : hal-00188342 , version 1

Citer

Huang Sun, Brice Effantin, Hamamache Kheddouci. A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph. 9th International Conference on Distributed Computing and Networking (ICDCN 2008), 2008, India. pp.209-214. ⟨hal-00188342⟩
70 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More