Skip to main content
SpringerLink
Log in

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

  • Distributed Computing
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1989)

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

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. 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. B. Awerbuch, A new distributed depth-first-search algorithm, Inform. Process. Lett. 20 (3) (1985) 147–150.

    Article  Google Scholar 

  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. I. Cidon, Yet another distributed depth-first-search algorithm, Inform. Process. Lett. 26 (6) (1988) 301–305.

    Article  Google Scholar 

  5. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, (Computer Science Press, Potomac, MD, 1978).

    Google Scholar 

  6. C. Savage and J. Ja'Ja, Fast, efficient parallel algorithms for some graph problems, SIAM J. Comput. 10 (1981) 682–691.

    Article  Google Scholar 

  7. R. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (4) (1985) 862–874.

    MathSciNet  Google Scholar 

  8. R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1 (2) (1972) 146–160.

    Article  Google Scholar 

  9. R. Tarjan, A note on finding the bridges of a graph, Inform. Process. Lett. 2 (1974) 160–161.

    Article  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  11. Y. Tsin and F. Chin, A general program scheme for finding bridges, Inform. Process. Lett. 17 (1983) 269–272.

    Article  Google Scholar 

  12. Y. Tsin and F. Chin, Efficient parallel algorithms for a class of graph theoretic problems, SIAM J. Comput. 13 (1984) 580–599.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, The Ohio State University, 43210, Columbus, Ohio

    Mohan Ahuja & Yahui Zhu

Authors
  1. Mohan Ahuja
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yahui Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. E. Veni Madhavan

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ahuja, M., Zhu, Y. (1989). An efficient distributed algorithm for finding articulation points, Bridges, and biconnected components in asynchronous networks. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-52048-1_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52048-1

  • Online ISBN: 978-3-540-46872-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation