Fault tolerant distributed coloring algorithms that stabilize in linear time

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 146-

  Hedetniemi, S T ^a   Jacobs, D P ^a   Srimani, P K ^a  

^a AMRL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33746654487     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1016537     Document Type: Conference Paper

References (16)

1. M Gradinariu and S Tixeuil. Self-stabilizing vertex coloration and arbritary graphs. In 4th International Conference On Principles Of DIstributed Systems, OPODIS'2000, pages 55-70, 2000.
2. T. R. Jensen and B. Toft. Graph coloring Problems. John Wiley & Sons, New York, 1995.
3. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, November 1974.
4. E. W. Dijkstra. A belated proof of self-stabilization. Distributed Computing, 1(1):5-6, 1986.
5. M Nesterenko and A Arora. Stabilization-preserving atomicity refinement. In DISC99 Distributed Computing 13th International Symposium, Springer-Verlag LNCS:1693, pages 254-268, 1999.
6. G Antonoiu and PK Srimani. Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity. In Europar'99 Parallel Processing, Proceedings LNCS:1685, pages 823-830, 1999.
7. J Beauquier, AK Datta, M Gradinariu, and F Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In DISC00 Distributed Computing 14th International Symposium, Springer-Verlag LNCS:1914, 2000.
8. S Ghosh and MH Karaata. A self-stabilizing algorithm for coloring planar graphs. Distributed Computing, 7:55-59, 1993.
9. S Sur and PK Srimani. A self-stabilizing algorithm for coloring bipartite graphs. Information Sciences, 69:219-227, 1993.
10. SK Shukla, DJ Rosenkrantz, and SS Ravi. Observations on self-stabilizing graph algorithms for anonymous networks. In Proceedings of the Second Workshop on Self-Stabilizing Systems, pages 7.1-7.15, 1995.
11. F Petit and V Villain. A space-efficient and self-stabilizing depth-first token circulation protocol for asynchronous message-passing systems. In Europar'97 Parallel Processing, Proceedings LNCS:1300, pages 476-479. Springer-Verlag, 1997.
12. M. R. Garey and M. R. Johnson. Computers and Intractability. Freeman, New York, 1979.
13. R. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-104. Plenum Press, 1972.
14. P. M. Grundy. Mathematics and games. Eureka, 2:6-8, 1939.
15. G. R. Grimmett and C. J. H. McDiarmid. On coloring random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 77:313-324, 1975.
16. R. L. Brooks. On coloring the nodes of a network. Proceedings Cambridge Philos. Society, 37:197-227, 1941.