Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees

A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

“…Kosowski and Kuszner [46] proposed a semi-uniform algorithm for the 2-coloring of bipartite graphs, assuming a central daemon and an anonymous system. Here, the idea is slightly similar to the one used by Sur and Srimani to design their algorithm.…”

A Message-Passing Algorithm for Wireless Network Scheduling

“…With every node having the correct root information, graph $\mathrm{scriptG}$ can be colored using at most 2 D colors in a number of steps that is polynomial in the size of the graph [27], given that each node in $\mathrm{scriptV}$ has a unique identifier and known by its neighbors. The coloring algorithm in [27] assumes a special node, which can be found by the competition algorithm in Fig.…”

“…The coloring algorithm in [27] assumes a special node, which can be found by the competition algorithm in Fig. 3.…”

“…3. Moreover, the coloring algorithm in [27] is a distributed one that is optimal for bipartite graphs, i.e., it colors any bipartite graph with two colors. In the sequel, for each node $i\in \mathcal{V}$ we denote by c i ∈ {1, … , 2 D } the color of itself as the result of the competition algorithm in Fig.…”

“…In the sequel, for each node $i\in \mathcal{V}$ we denote by c i ∈ {1, … , 2 D } the color of itself as the result of the competition algorithm in Fig. 3 and the coloring algorithm in [27], and let c = ( c 1 , … , c N ).…”