Randomized Self-stabilization under Distributed Daemon for 6-Coloring Planar Graph
Self-stabilization is a fault-tolerant mechanism that enables a distributed system to recover from transient faults. In this paper, we consider the coloring problem and propose the first self-stabilizing algorithm under the distributed daemon model to 6-color planar graphs. The algorithm is randomized, anonymous and uniform. Starting from any initial configuration, it finds a proper coloring inO(n) rounds for an n-node graph.
KeywordsDistributed computing Planar graph Randomization Self-stabilization Graph Coloring
Unable to display preview. Download preview PDF.
- 7.Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloring of arbitrary graphs. In: Proceedings of the International Conference on Principles of Distributed Systems, OPODIS, pp. 55–70 (2000)Google Scholar