Linear time self-stabilizing colorings

Information Processing Letters

Volumn 87, Issue 5, 2003, Pages 251-255

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

^a AMRL   (United States)

Author keywords

Algorithms; Distributed systems; Grundy coloring; Self stabilizing coloring

Indexed keywords

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS;

GLOBAL STATE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0042592950     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00299-0     Document Type: Article

References (15)

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