Self-stabilizing algorithm for bridge finding

Distributed Computing

Volumn 12, Issue 1, 1999, Pages 47-53

  Karaata, Mehmet Hakan ^a   Chaudhuri, Pranay ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS;

SELF-STABILIZING ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0033279246     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050055     Document Type: Article

References (21)

1. Awerbuch B, Varghese G: Distributed program checking: A paradigm for building self-stabilizing distributed protocols. 31st Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 258-267
2. Burns JE, Pachl J: Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems 11:330-344 (1989)
3. Chaudhuri P: Parallel Algorithms: Design and Analysis. Sydney: Prentice-Hall 1992
4. Chaudhuri P: An efficient distributed bridge-finding algorithm. Information Sciences 81:73-85 (1994)
5. Dijkstra EW: Self-stabilizing systems in spite of distributed control. EWD 391, In Selected Writings on Computing: A Personal Perspective, 1973, pp. 41-46
6. Dijkstra EW: Some beautiful arguments using mathematical induction. Acta Informatica 13:1-8 (1980)
7. Dolev S, Israeli A, Moran S: Self-stabilization of dynamic systems assuming only read/write atomicity. 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 103-118
8. Ghosh S, Karaata MH: A self-stabilizing algorithm for coloring planar graphs. Distrib Comput 7:55-59 (1993)
9. Herman T: Probabilistic self-stabilization. Inform Process Lett 35:63-67 (1990)
10. Huang ST: Leader election in uniform rings. ACM Transactions on Programming Language Systems 15:563-573 (1993)
11. Huang ST, Chen NS: A self-stabilizing algorithm for constructing breadth-first trees. Inform Process Lett 41:109-117 (1992)
12. Israeli A, Jalfon M: Token management schemes and random walks yield self-stabilizing mutual exclusion. 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 119-132
13. Katz S, Perry KJ: Self-stabilizing extensions for message passing systems. 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 91-101
14. Kruijer HSM: Self-stabilization (in spite of distributed control) in tree-structured systems. Inform Process Lett 8:91-95 (1979)
15. Lin X, Ghosh S: Self-stabilizing maxima finding. In Proceedings of the 28th Annual Allerton Conference, 1991, pp. 662-671
16. Savage C, Ja' JJ: Fast, efficient parallel algorithms for some graph problems. SIAM J Comput 10:682-691 (1981)
17. Schneider M: Self-stabilization. ACM Comput Surv 25:45-67 (1993)
18. Sur S, Srimani PK: A self-stabilizing distributed algorithm for BFS spanning trees of a symmetric graph. Parallel Process Lett 2:171-179 (1992)
19. Tarjan RE: Sorting using networks of stacks and queues. Journal of the ACM 19:341-346 (1972)
20. Tarjan RE, Vishkin U: An efficient parallel biconnectivity algorithm. TR-69, Ultracomputer Note-51, CoTR-69, Ultracomputer Note-51, Courant Institute of Mathematical Sciences, NY, 1983
21. Tsin YH, Chin FY: Efficient parallel algorithms for class of graph theoretic problems. SIAM J Comput 13:580-599 (1984)