Part of the Lecture Notes in Computer Science book series (LNCS, volume 405)
An efficient distributed algorithm for finding articulation points, Bridges, and biconnected components in asynchronous networks
KeywordsSpan 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.
- 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
- 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
- E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, (Computer Science Press, Potomac, MD, 1978).Google Scholar
© Springer-Verlag Berlin Heidelberg 1989