A self-stabilizing algorithm for finding cliques in distributed systems

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 390-395

  Ishii, Hiroko ^b   Kakugawa, Hirotsugu ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER NETWORKS; GRAPH THEORY; PROBLEM SOLVING;

CLIQUES;

DISTRIBUTED COMPUTER SYSTEMS;

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

References (8)

1. N.S. Chen, H.P. Yu, and S.T. Huang. A self-stabilizing algorithm for constructing spanning trees. Inf. Process. Lett., 39(3):147-151, 1991.
2. E.W. Dijkstra. Self-stabilizing systems in spite of distributed control. Commun. ACM, 17(11):643-644, 1974.
3. F.C. Gärtner. Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Comput. Surv., 31:1-26, 1999.
4. R.A. Golding and K. Taylor. Group membership in the epidemic style. Technical report, University of California, Santa Cruz, 1992.
5. M.H. Karaata, S.V. Pemmaraju, S.C. Bruell, and S. Ghosh. Self-stabilizing algorithms for finding centers and medians of trees. In Proceedings of 13th Annual ACM Symposium on Principles of Distributed Computing, page 374, 1994.
6. J.L.W. Kessels. An exercise in proving self-stabilization with a variant function. Inf. Process. Lett., 29(1):39-42, Sept. 1988.
7. M. Schneider. Self-stabilization. ACM Comput. Surv., 25(1):45-67, Mar. 1993.
8. S.K. Shukla, D.J. Rosenkrantz, and S.S. Ravi. Observation on self-stabilizing graph algorithms for anonymous networks. Proceedings of the second workshop on self-stabilizing systems, 1995.