Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
M. J. Atallah, S. R. Kosaraju, Graph Problems on a Mesh-Connected Processor Array, JACM, Vol 31, No 3, July 1984, 649–667.
L. J. Guibas, H. T. Kung, C. D. Thompson, Direct VLSI Implementation of Combinatorial Algorithms, In Proc. Caltec Conf. on VLSI, 1979, 509–525.
H.-W. Lang, Transitive Closure on an Instruction Systolic Array, to appear in Proc. Int. Conf. on Systolic Arrays, San Diego, California, May 1988.
J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, Maryland, 1984.
M. Zubair, B. B. Madan, Efficient Systolic Algorithm for Finding Bridges in a Connected Graph, Parallel Computing, 6, 1988, 57–61
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schimmler, M., Schröder, H. (1989). A simple systolic method to find all bridges of an undirected graph. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_49
Download citation
DOI: https://doi.org/10.1007/3-540-50728-0_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50728-4
Online ISBN: 978-3-540-46076-3
eBook Packages: Springer Book Archive