An incremental distributed algorithm for computing biconnected components

Extended abstract
  • Bala Swaminathan
  • Kenneth J. Goldman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 857)


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.


biconnected components distributed graph algorithms dynamic configuration 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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.CrossRefGoogle Scholar
  3. 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. 4.
    Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.Google Scholar
  5. 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. 6.
    Walter Hohberg. How to find biconnected components in distributed networks. Journal of Parallel and Distributed Computing, 9(4):374–386, August 1990.CrossRefGoogle Scholar
  7. 7.
    Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 27(7):558–565, July 1978.CrossRefGoogle Scholar
  8. 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. 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. 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. 11.
    Robert E. Tarjan and Uzi Vishikin. An efficient parallel biconnectivity algorithm. SIAM Journal of Computing, 14(4):862–874, 1985.CrossRefGoogle Scholar
  12. 12.
    Jeffery Westbrook and Robert E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433–464, 1992.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Bala Swaminathan
    • 1
  • Kenneth J. Goldman
    • 1
  1. 1.Department of Computer ScienceWashington UniversitySt. LouisUSA

Personalised recommendations