Efficient parallel triconnectivity in logarithmic time

Extended abstract
  • Vijaya Ramachandran
  • Uzi Vishkin
Parallel Set And Graph Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 319)


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.

Unable to display preview. Download preview PDF.


  1. [AlSc]
    N. Alon, B. Schieber, "Optimal preprocessing for answering on-line product queries," tech. report, Tel Aviv University, May 1987.Google Scholar
  2. [AtVi]
    M. J. Attalah, U. Vishkin, "Finding Euler tours in parallel", Jour. Comput. and System Sciences, vol. 29, pp. 330–337, 1984.CrossRefGoogle Scholar
  3. [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
  4. [Ev]
    S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979.MATHGoogle Scholar
  5. [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
  6. [Ga]
    C. F. Gauss, "Werke," Teubner, Leipzig, 1900, pp. 272 and 282–286.Google Scholar
  7. [HiChSa]
    D. S. Hirschberg, A. K. Chandra, D. V. Sarwate, "Computing connected components on parallel computers," CACM, vol. 22, 1979, pp. 461–464.MATHMathSciNetGoogle Scholar
  8. [LoMa]
    L. Lovasz, M. L. Marx, "A forbidden substructure characterization of Gauss codes," Bull. Amer. Math. Soc., vol. 82, 1976, pp. 121–122.MATHMathSciNetCrossRefGoogle Scholar
  9. [MaScVi]
    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.MATHMathSciNetCrossRefGoogle Scholar
  10. [MiRa]
    G. L. Miller, V. Ramachandran, "Efficient parallel ear decomposition with applications," unpublished manuscript, MSRI, Berkeley, CA, January 1986.Google Scholar
  11. [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
  12. [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
  13. [RoTa]
    P. Rosenstiehl, R.E. Tarjan, "Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations," J. Algorithms, Vol. 5, no. 3, 1984, pp. 375–390.MATHMathSciNetCrossRefGoogle Scholar
  14. [ShVi]
    Y. Shiloach, U. Vishkin, "An O(logn) parallel connectivity algorithm," J. Algorithms, vol. 3, 1982, pp. 57–63.MATHMathSciNetCrossRefGoogle Scholar
  15. [Wh]
    H. Whitney, "Non-separable and planar graphs," Trans. Amer. Math. Soc., vol. 34, 1932, pp. 339–362.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Vijaya Ramachandran
    • 1
    • 2
  • Uzi Vishkin
    • 3
    • 4
  1. 1.Coordinated Science LabUniversity of IllinoisUrbana
  2. 2.International Computer Science InstituteBerkeley
  3. 3.Sackler Faculty of Exact SciencesTel Aviv UniversityTel AvivIsrael
  4. 4.Courant InstituteNew York UniversityNew York

Personalised recommendations