An efficient distributed algorithm for finding articulation points, Bridges, and biconnected components in asynchronous networks

  • Mohan Ahuja
  • Yahui Zhu
Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 405)


Span Tree Message Size Articulation Point Tree Edge Back Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Ahuja and Y. Zhu, On the communication complexities in two distributed depth first search algorithms, OSU-CISRC-12/88-TR41, The Ohio State University.Google Scholar
  2. [2]
    B. Awerbuch, A new distributed depth-first-search algorithm, Inform. Process. Lett. 20 (3) (1985) 147–150.CrossRefGoogle Scholar
  3. [3]
    E. J. H. Chang, Echo algorithms: depth parallel operations on general graphs, IEEE Trans. on Software Eng. SE-8 (4) (1982) 391–401.Google Scholar
  4. [4]
    I. Cidon, Yet another distributed depth-first-search algorithm, Inform. Process. Lett. 26 (6) (1988) 301–305.CrossRefGoogle Scholar
  5. [5]
    E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, (Computer Science Press, Potomac, MD, 1978).Google Scholar
  6. [6]
    C. Savage and J. Ja'Ja, Fast, efficient parallel algorithms for some graph problems, SIAM J. Comput. 10 (1981) 682–691.CrossRefGoogle Scholar
  7. [7]
    R. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (4) (1985) 862–874.MathSciNetGoogle Scholar
  8. [8]
    R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1 (2) (1972) 146–160.CrossRefGoogle Scholar
  9. [9]
    R. Tarjan, A note on finding the bridges of a graph, Inform. Process. Lett. 2 (1974) 160–161.CrossRefGoogle Scholar
  10. [10]
    K. Lakshmanan, N. Meenakshi and K. Thulasiraman, A time-optimal message-efficient distributed algorithm for depth first search, Inform. Process. Lett. 25 (2) (1987) 103–109.CrossRefMathSciNetGoogle Scholar
  11. [11]
    Y. Tsin and F. Chin, A general program scheme for finding bridges, Inform. Process. Lett. 17 (1983) 269–272.CrossRefGoogle Scholar
  12. [12]
    Y. Tsin and F. Chin, Efficient parallel algorithms for a class of graph theoretic problems, SIAM J. Comput. 13 (1984) 580–599.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Mohan Ahuja
    • 1
  • Yahui Zhu
    • 1
  1. 1.Department of Computer and Information ScienceThe Ohio State UniversityColumbus

Personalised recommendations