Fault tolerant algorithms for orderings and colorings

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 2453-2460

  Goddard, Wayne ^a   Hedetniemi, Stephen T ^a   Jacobs, David P ^a   Srimani, Pradip K ^a  

^a AMRL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANT ALGORITHMS; GRAPH COLORING; K-FORWARD NUMBERING; SELF-STABILIZATION (S-S) ALGORITHMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; POLYNOMIALS; THEOREM PROVING;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 12444316039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. G. Antonoiu and P.K. Srimani. A self-stabilizing distributed algorithm to find the center of a tree graph. Parallel Algorithms and Applications, 10:237-248, 1997.
2. S.C. Bruell, S. Ghosh, M.H. Karaata, and S.V. Pemmaraju. Self-stabilizing algorithms for finding centers and medians of trees. SIAM Journal on Computing, 29(2):600-614, 1999.
3. M. Demirbas and H. Ferhatosmanoglu. Peer-to-peer spatial queries in sensor networks. In 3rd IEEE International Conference on Peer-to-Peer Computing, (P2P '03). Linköping, Sweden, September 2003.
4. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, November 1974.
5. E. W. Dijkstra. A belated proof of self-stabilization. Distributed Computing, 1(1):5-6, 1986.
6. S. Dolev and T. Herman. Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science, 3(4), 1997.
7. S. Dolev. Self-stabilization, MIT Press, 2000.
8. S. Dolev, E. Schiller, and J. Welch. Random walk for self-stabilizing group communication in ad-hoc networks. In Proc. 21st IEEE Symposium on Reliable Distributed Systems, pages 70-79, 2002.
9. S. Ghosh and M.H. Karaata. A self-stabilizing algorithm for coloring planar graphs. Distributed Computing, 7:55-59, 1993.
10. M. Gradinariu and S. Tixeuil. Self-stabilizing vertex coloration of arbitrary graphs. In 4th International Conference On Principles Of Distributed Systems, OPODIS'2000, pages 55-70. Studia Informatica Universalis, 2000.
11. S. T. Hedetniemi, D. P. Jacobs, and P.K. Srimani. Linear-time self-stabilizing colorings. Information Processing Letters, 87:251-255, 2003.
12. T.R. Jensen and B. Toft. Graph Coloring Problems. Wiley, 1994.
13. S. S. Kulkarni and U. Arumugam. Collision-free communication in sensor networks. In Proceedings Self-Stabilizing Systems: 6th International Symposium, SSS 2003, San Francisco, pages 17-31, Springer-Verlag, Heidelberg, 2003
14. S. Shukla, D. Rosenkrantz, and S. Ravi. Developing self-stabilizing coloring algorithms via systematic randomization. In Proceedings of the International Workshop on Parallel Processing, pages 668-673, Bangalore, India, 1994. Tata-McGraw Hill, New Delhi.