Abstract
We present two new techniques for trimming a logarithmic factor from the running time of efficient parallel algorithms for graph problems. The main application of our techniques is an improvement in running time from O (log2 n) to O(logn) for efficient triconnectivity testing in parallel. Additional applications include almost optimal O(logn) time algorithms for recognizing Gauss codes, for testing planarity of graphs with a known Hamiltonian cycle and for testing if a permutation is sortable on two stacks.
Supported by Joint Services Electronics Program under N00014-84-C-0149, the Semiconductor Research Corporation under 86-12-109, and the International Computer Science Institute, Berkeley, CA.
Supported by NSF grants NSF-CCR-8615337 and NSF-DCR-8413359, ONR grant N00014-85-K-0046, by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U. S. Department of Energy, under contract number DE-AC02-76ER03077 and the Foundation for Research in Electronics, Computers and Communication administered by the Israeli Academy of Sciences and Humanities.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Alon, B. Schieber, "Optimal preprocessing for answering on-line product queries," tech. report, Tel Aviv University, May 1987.
M. J. Attalah, U. Vishkin, "Finding Euler tours in parallel", Jour. Comput. and System Sciences, vol. 29, pp. 330–337, 1984.
R. Cole, U. Vishkin, "Approximate and exact parallel scheduling with applications to list, tree and graph problems," Proc. 27th Ann. Symp. on Foundations of Comp. Sci., Toronto, Canada, Oct. 1986.
S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979.
S. Even, A. Itai, "Queues, stacks, and graphs," Theory of Machines and Computations, Z. Kohavi and A. Paz, eds., Academic Press, New York, NY, 1971, pp. 71–86.
C. F. Gauss, "Werke," Teubner, Leipzig, 1900, pp. 272 and 282–286.
D. S. Hirschberg, A. K. Chandra, D. V. Sarwate, "Computing connected components on parallel computers," CACM, vol. 22, 1979, pp. 461–464.
L. Lovasz, M. L. Marx, "A forbidden substructure characterization of Gauss codes," Bull. Amer. Math. Soc., vol. 82, 1976, pp. 121–122.
Y. Maon, B. Schieber, U. Vishkin, "Parallel ear decomposition search (EDS) and st-numbering in graphs," Theoretical Computer Science, vol. 47, 1986, pp. 277–298.
G. L. Miller, V. Ramachandran, "Efficient parallel ear decomposition with applications," unpublished manuscript, MSRI, Berkeley, CA, January 1986.
G. L. Miller, V. Ramachandran, "A new graph triconnectivity algorithm and its parallelization," Proc. ACM Symp. on Theory of Computing, New York, NY, May 1987.
P. Rosenstiehl, "Solution algebrique du probleme de Gauss sur la permutation des points d'intersection d'une ou plusiers courbes fermees du plan," C. R. Acad. Sci. Paris, vol. 283, no. 8, 1976.
P. Rosenstiehl, R.E. Tarjan, "Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations," J. Algorithms, Vol. 5, no. 3, 1984, pp. 375–390.
Y. Shiloach, U. Vishkin, "An O(logn) parallel connectivity algorithm," J. Algorithms, vol. 3, 1982, pp. 57–63.
H. Whitney, "Non-separable and planar graphs," Trans. Amer. Math. Soc., vol. 34, 1932, pp. 339–362.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramachandran, V., Vishkin, U. (1988). Efficient parallel triconnectivity in logarithmic time. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040371
Download citation
DOI: https://doi.org/10.1007/BFb0040371
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96818-6
Online ISBN: 978-0-387-34770-7
eBook Packages: Springer Book Archive