A simple systolic method to find all bridges of an undirected graph

  • Manfred Schimmler
  • Heiko Schröder
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 344)


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 [1]. But it has a significantly simpler structure and therefore, it gains a constant factor of about two in time.


mesh-connected processor array systolic algorithm bridges in graphs transitive closure complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [1]
    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
  2. [2]
    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
  3. [3]
    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
  4. [4]
    J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, Maryland, 1984.Google Scholar
  5. [5]
    M. Zubair, B. B. Madan, Efficient Systolic Algorithm for Finding Bridges in a Connected Graph, Parallel Computing, 6, 1988, 57–61Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Manfred Schimmler
    • 1
  • Heiko Schröder
    • 2
  1. 1.Institut für Informatik und Praktische MathematikKiel 1West Germany
  2. 2.Department of Engineering PhysicsAustralian National UniversityCanberraAustralia

Personalised recommendations