Abstract
We describe a graph search technique called open ear decomposition and its applicability in the design of algorithms for several connectivity problems on undirected graphs. All of these algorithms have optimal or efficient parallel and sequential implementations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Cole, R. & Vishkin, U., "Approximate and exact parallel techniques with applications to list, tree and graph problems," Proc. 27th Ann. IEEE Symp. on Foundations of Comp. Sci., 1986, pp. 478–491.
Even, S. Graph Algorithms, Computer Science Press, Potomac, MD, 1979.
Even, S. & Tarjan, R. "Computing an st-numbering," Theoretical Computer Science 2, 1976, pp. 339–344.
Fussell, D., Ramachandran, V. & Thurimella, R., "Finding triconnected components by local replacements," Proc ICALP, Italy, Springer-Verlag LNCS, July 1989, to appear.
Hopcroft, J.E. & Tarjan, R.E. "Dividing a graph into triconnected components," SIAM J. Computing 2, 1973, pp. 135–158.
Jung, H. "An optimal parallel algorithm for computing connected components in a graph," Preprint. Humboldt-University Berlin, German Democratic Republic, 1989.
Kanevsky, A. & Ramachandran, V., "Improved algorithms for graph four-connectivity," Proc. 28th Annual IEEE Symp. on Foundations of Comp. Sci., 1987, pp. 252–259; Jour. of Computer and System Science, to appear.
Karp, R.M. & Ramachandran, V. "Parallel algorithms for shared-memory machines," Handbook of Theoretical Computer Science, North-Holland, 1989, to appear.
Klein, P. & J.H. Reif, "An efficient algorithm for planarity," Proc. 27th Annual IEEE Symp. on Foundations of Computer Science, 1986, pp. 465–477.
Lempel, A., Even, S. & Cederbaum, I. "An algorithm for planarity testing of graphs,"Theory of Graphs: International Symposium, Rome, July 1966, Gordon and Breach, New York, NY, pp. 215–232.
Lovasz, L. "Computing ears and branchings in parallel," 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 464–467.
Maon, Y., Schieber, B. & Vishkin, U. "Parallel ear decomposition search (EDS) and stnumbering in graphs," VLSI Algorithms and Architectures, Lecture Notes in Computer Science 227, 1986, pp. 34–45.
Miller, G.L. & Ramachandran, V. "Efficient parallel ear decomposition with applications," unpublished manuscript, MSRI, Berkeley, CA, January 1986.
Miller, G.L. & Ramachandran, V. "A new graph triconnectivity algorithm and its parallelization," Proc. 19th Annual ACM Symp. on Theory of Computing, New York, NY, 1987, pp. 335–344.
Ramachandran, V. & Vishkin, U. "Efficient parallel triconnectivity in logarithmic time," VLSI Algorithms and Architectures, Springer-Verlag LNCS 319, 1988, pp. 33–42.
Schieber, B. & Vishkin, U. "On finding lowest common ancestors: simplification and parallelization," VLSI Algorithms and Architectures, Springer-Verlag LNCS 319, 1988, pp. 111–123.
Tarjan, R. E., "Depth first search and linear graph algorithms," SIAM J. Comput. 1, 1972, pp. 146–160.
Tarjan, R.E. & Vishkin, U. "An efficient parallel biconnectivity algorithm," SIAM J. Computing 14, 1984, pp. 862–874.
Tutte, W. T., Connectivity in Graphs, University of Toronto Press, 1966.
Whitney, H. "Non-separable and planar graphs," Trans. Amer. Math. Soc. 34, 1930, pp. 339–362.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramachandran, V. (1989). A framework for parallel graph algorithm design. In: Djidjev, H. (eds) Optimal Algorithms. OA 1989. Lecture Notes in Computer Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51859-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-51859-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51859-4
Online ISBN: 978-3-540-46831-8
eBook Packages: Springer Book Archive