An incremental distributed algorithm for computing biconnected components in dynamic graphs

Algorithmica (New York)

Volumn 22, Issue 3, 1998, Pages 305-329

  Swaminathan, B ^a,b   Goldman, K J ^a  

^a WASHINGTON UNIVERSITY   (United States)

^b FUJITSU LABORATORIES LTD   (Japan)

Author keywords

Biconnected components; Distributed graph algorithms; Dynamic configuration

Indexed keywords

EID: 0009630205     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009226     Document Type: Article

References (18)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. M. Ahuja. Assertions about past and future in highways: global flush broadcast and flush-vector-time. Information Processing Letters, 48(1):21-28, 1993.
3. M. Ahuja and Y. Zhu. An efficient distributed algorithm for finding articulation points, bridges, and biconnected components in asynchronous networks. In Proceedings of the 9th Conference on Foundation of Software Technology and Theoretical Computer Science, Bangalore, pages 99-108. LNCS 405; Springer-Verlag, Berlin, December 1989.
4. K. P. Birman. A response to Cheriton and Skeen's criticism of causal and totally ordered communication. Operating Systems Review, 28(1):11-21, January 1994.
5. K. P. Birman, A. Schiper, and P. Stephenson. Lightweight causal and atomic group multicast. ACM Transactions on Computer Systems, 9(3):272-314, August 1991.
6. E. J. H. Chang. Echo algorithms: depth parallel operations on general graphs. IEEE Transactions on Software Engineering, 8(4):391-401, 1982.
7. D. R. Cheriton and D. Skeen. Understanding the limitations of causally and totally ordered communication. Operating Systems Review, 27(5): 44-57, 1993.
8. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
9. J. R. Cox, Jr., M. Gaddis, and J. S. Turner. Project Zeus: design of a broadband network and its application on a university campus. IEEE Network, pages 20-30, March 1993.
10. K. J. Goldman, M. D. Anderson, and B. Swaminathan. The programmers' playground: I/O abstraction for heterogeneous distributed systems. In Proceedings of the 27th Hawaii International Conference on System Sciences (HICSS), pages 363-372, January 1994.
11. W. Hohberg. How to find biconnected components in distributed networks. Journal of Parallel and Distributed Computing, 9(4):374-386, August 1990.
12. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, July 1978.
13. J. Park, N. Tokura, T. Masuzawa, and K. Hagihara. Efficient distributed algorithms solving problems about the connectivity of network. Systems and Computers in Japan, 22(8):1-16, May 1991.
14. M. Rauch. Fully dynamic biconnectivity in graphs. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 50-59, October 1992.
15. B. Swaminathan and K. J. Goldman. An incremental distributed algorithm for computing biconnected components (extended abstract). In Proceedings of the 8th International Workshop on Distributed Algorithms, Terschelling, The Netherlands, pages 238-252; LNCS 857. Springer-Verlag, Berlin, 1994.
16. R. E. Tarjan and U. Vishikin. An efficient parallel biconnectivity algorithm. SIAM Journal of Computing, 14(4):862-874, 1985.
17. B. J. Vickers and T. Suda. Connectionless service for public ATM networks. IEEE Communications Magazine, 32(8):34-42, August 1994.
18. J. Westbrook and R. E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433-464, 1992.