Fault tolerant algorithms for orderings and colorings

Abstract

Ghosh and Karaata [9], as well as 2-color trees and 3-color series-parallel graphs. We discuss how our s-s algorithms can be extended to the synchronous model.

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

“…In [23] Goddard et al investigated a problem, which has strong connection with the coloring problem, called the k-forward numbering of graphs. This latter consists in assigning integers to the nodes, such that no node will have more than k neighbors with larger assigned values.…”

Self-Stabilizing Global Optimization Algorithms for Large Network Graphs

“…Several authors have considered self-stabilizing algorithms for graph problems. For example, matchings are studied in [14,16], maximal independent sets in [20], and domination in [21][22][23][24]. A more comprehensive list of references to past related works can be found in those cited works.…”