Skip to main content
SpringerLink
Log in

An incremental distributed algorithm for computing biconnected components

Extended abstract

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 857))

Included in the following conference series:

Abstract

This paper describes a distributed algorithm for computing biconnected components of a dynamically changing graph. Our algorithm has worst case communication complexity of O(b + c) messages for edge insertion and O(b′ + c) messages for edge removal, and worst case time complexity of O(c) for both operations, where c is the maximum number of biconnected components in any of the connected components during the operation, b is the number of nodes in the biconnected component containing the new edge, and b′ is the number of nodes in the biconnected component in which the update is being processed.

The algorithm is presented in two stages. First, a serial algorithm is presented in which topology updates occur one at a time. Then, building on the serial algorithm, an algorithm is presented in which concurrent update requests are serialized within each connected component. The problem is motivated by the need to implement causal ordering of messages efficiently in a dynamically changing communication structure.

This research was supported in part by the National Science Foundation under Grants CCR-91-10029 and CCR-94-12711.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mohan Ahuja and Yahui Zhu. An efficient distributed algorithm for finding articulation points, bridges, and biconnected components in asynchronous networks. In Proceedings of the 9th Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India. LNCS 405, pages 99–108. Springer-Verlag, December 1989.

    Google Scholar 

  2. Kenneth Birman, Andre Schiper, and Pat Stephenson. Lightweight causal and atomic group multicast. ACM Transactions on Computer Systems, 9(3):272–314, August 1991.

    Article  Google Scholar 

  3. E. J. H. Chang. Echo algorithms: Depth parallel operations on general graphs. IEEE Transactions on Software Engineering, 8(4):391–401, 1982.

    Google Scholar 

  4. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  5. Kenneth J. Goldman, Michael D. Anderson, and Bala Swaminathan. The Programmers' Playground: I/O abstraction for heterogeneous distributed systems. In 27th Hawaii International Conference on System Sciences (HICSS), pages 363–372, January 1994.

    Google Scholar 

  6. Walter Hohberg. How to find biconnected components in distributed networks. Journal of Parallel and Distributed Computing, 9(4):374–386, August 1990.

    Article  Google Scholar 

  7. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 27(7):558–565, July 1978.

    Article  Google Scholar 

  8. Jungho Park, Nobuki Tokura, Toshimitsu Masuzawa, and Kenichi Hagihara. Efficient distributed algorithms solving problems about the connectivity of network. Systems and Computers in Japan, 22(8):1–16, May 1991.

    Google Scholar 

  9. Monika Rauch. Fully dynamic biconnectivity in graphs. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 50–59, October 1992.

    Google Scholar 

  10. Bala Swaminathan and Kenneth J. Goldman. An incremental distributed algorithm for computing biconnected components (extended abstract). Technical Report WUCS-94-6, Washington University in St. Louis, February 1994.

    Google Scholar 

  11. Robert E. Tarjan and Uzi Vishikin. An efficient parallel biconnectivity algorithm. SIAM Journal of Computing, 14(4):862–874, 1985.

    Article  Google Scholar 

  12. Jeffery Westbrook and Robert E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433–464, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Washington University, 63130, St. Louis, MO, USA

    Bala Swaminathan & Kenneth J. Goldman

Authors
  1. Bala Swaminathan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenneth J. Goldman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerard Tel Paul Vitányi

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Swaminathan, B., Goldman, K.J. (1994). An incremental distributed algorithm for computing biconnected components. In: Tel, G., Vitányi, P. (eds) Distributed Algorithms. WDAG 1994. Lecture Notes in Computer Science, vol 857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020437

Download citation

  • DOI: https://doi.org/10.1007/BFb0020437

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58449-0

  • Online ISBN: 978-3-540-48799-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation