A self-stabilizing algorithm for coloring bipartite graphs

Information Sciences - Tập 69 - Trang 219-227 - 1993
Sumit Sur1, Pradip K. Srimani1
1Department of Computer Science, Colorado State University, Ft. Collins, Colorado 80523 USA

Tài liệu tham khảo

Chen, 1991, A self-stabilizing algorithm for constructing spanning trees, Inform. Process. Lett., 39, 142, 10.1016/0020-0190(91)90111-T Dijkstra, 1974, Self-stabilizing systems in spite of distributed control, Commun. ACM, 17, 643, 10.1145/361179.361202 Dijkstra, 1986, A belated proof of self-stabilization, J. Distributed Comput., 1, 15, 10.1007/BF01843566 Flatebo, 1992, Two-state self-stabilizing algorithms Flatebo, 1992, Self-stabilization in distributed systems Ghosh, 1990, Self-stabilizing distributed systems with binary machines Ghosh, 1991, A self-stabilizing algorithm for graph coloring Kessels, 1988, An exercise in proving self-stabilization with a variant function, Inform. Process. Lett., 29, 39, 10.1016/0020-0190(88)90131-7