Keywords
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
B. Awerbuch, A new distributed depth-first-search algorithm, Inform. Process. Lett. 20 (3) (1985) 147–150.
E. J. H. Chang, Echo algorithms: depth parallel operations on general graphs, IEEE Trans. on Software Eng. SE-8 (4) (1982) 391–401.
I. Cidon, Yet another distributed depth-first-search algorithm, Inform. Process. Lett. 26 (6) (1988) 301–305.
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, (Computer Science Press, Potomac, MD, 1978).
C. Savage and J. Ja'Ja, Fast, efficient parallel algorithms for some graph problems, SIAM J. Comput. 10 (1981) 682–691.
R. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (4) (1985) 862–874.
R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1 (2) (1972) 146–160.
R. Tarjan, A note on finding the bridges of a graph, Inform. Process. Lett. 2 (1974) 160–161.
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.
Y. Tsin and F. Chin, A general program scheme for finding bridges, Inform. Process. Lett. 17 (1983) 269–272.
Y. Tsin and F. Chin, Efficient parallel algorithms for a class of graph theoretic problems, SIAM J. Comput. 13 (1984) 580–599.
Author information
Authors and Affiliations
Editor information
Rights 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