A simple systolic method to find all bridges of an undirected graph
An algorithm to find all bridges of an undirected graph on a mesh-connected processor array is presented. Asymptotically it has the same complexity in terms of time and space as the best previous known algorithm, the one of . But it has a significantly simpler structure and therefore, it gains a constant factor of about two in time.
Keywordsmesh-connected processor array systolic algorithm bridges in graphs transitive closure complexity
Unable to display preview. Download preview PDF.
- M. J. Atallah, S. R. Kosaraju, Graph Problems on a Mesh-Connected Processor Array, JACM, Vol 31, No 3, July 1984, 649–667.Google Scholar
- L. J. Guibas, H. T. Kung, C. D. Thompson, Direct VLSI Implementation of Combinatorial Algorithms, In Proc. Caltec Conf. on VLSI, 1979, 509–525.Google Scholar
- H.-W. Lang, Transitive Closure on an Instruction Systolic Array, to appear in Proc. Int. Conf. on Systolic Arrays, San Diego, California, May 1988.Google Scholar
- J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, Maryland, 1984.Google Scholar
- M. Zubair, B. B. Madan, Efficient Systolic Algorithm for Finding Bridges in a Connected Graph, Parallel Computing, 6, 1988, 57–61Google Scholar