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.