Self-stabilizing coloration in anonymous planar networks

Information Processing Letters

Volumn 95, Issue 1, 2005, Pages 307-312

  Huang, Shing Tsaan ^a   Hung, Su Shen ^b   Tzeng, Chi Hung ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Fault tolerance; Graph algorithms; Grundy coloring; Planar graph; Self stabilization; Vertex coloring

Indexed keywords

COMPUTATIONAL COMPLEXITY; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; RESOURCE ALLOCATION; SET THEORY; THEOREM PROVING;

GRAPH ALGORITHMS; GRUNDY COLORING; PLANAR GRAPH; SELF-STABILIZATION; VERTEX COLORING;

ALGORITHMS;

EID: 18844394862     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.03.005     Document Type: Article

References (9)

1. E.W. Dijkstra Self-stabilizing systems in spite of distributed control Comm. ACM 17 1974 643 644
2. S. Dolev, A. Israeli, and S. Moran Uniform dynamic self-stabilizing leader election IEEE Trans. Parallel Distrib. Systems 8 4 1997
3. S. Ghosh, and M.H. Karaata A self-stabilizing algorithm for coloring planar graph Distrib. Comput. 7 1993 55 59
4. M. Gradinariu, S. Tixeuil, Self-stabilizing vertex coloring of arbitrary graphs, in: OPODIS'2000, 2000, pp. 17-36
5. S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani Linear time self-stabilizing colorings Inform. Process. Lett. 87 2003 251 255
6. T.R. Jensen, and B. Toft Graph Coloring Problems 1995 John Wiley & Sons New York
7. N. Lynch Distributed Algorithms 1996 Morgan Kaufmann Los Altos, CA
8. S. Shukla, D. Rosenkrantz, S. Ravi, Development self-stabilizing coloring algorithms via systematic randomization, in: Proc. Internat. Workshop on Parallel Processing, 1994, pp. 668-673
9. S. Sur, and P.K. Srimani A self-stabilizing algorithm for coloring bipartite graphs Inform. Sci. 69 1993 2219 2227