Efficient parallel triconnectivity in logarithmic time
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.
Unable to display preview. Download preview PDF.
- [AlSc]N. Alon, B. Schieber, "Optimal preprocessing for answering on-line product queries," tech. report, Tel Aviv University, May 1987.Google Scholar
- [CoVi]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.Google Scholar
- [EvIt]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.Google Scholar
- [Ga]C. F. Gauss, "Werke," Teubner, Leipzig, 1900, pp. 272 and 282–286.Google Scholar
- [MiRa]G. L. Miller, V. Ramachandran, "Efficient parallel ear decomposition with applications," unpublished manuscript, MSRI, Berkeley, CA, January 1986.Google Scholar
- [MiRa2]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.Google Scholar
- [Ro]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.Google Scholar