, Volume 12, Issue 1, pp 53–76

A new graph triconnectivity algorithm and its parallelization

  • Gary L. Miller
  • Vijaya Ramachandran

DOI: 10.1007/BF01191205

Cite this article as:
Miller, G.L. & Ramachandran, V. Combinatorica (1992) 12: 53. doi:10.1007/BF01191205


We present a new algorithm for finding the triconnected components of an undirected graph. The algorithm is based on a method of searching graphs called ‘open ear decomposition’. A parallel implementation of the algorithm on a CRCW PRAM runs inO(log2n) parallel time usingO(n+m) processors, wheren is the number of vertices andm is the number of edges in the graph.

AMS subject classification (1991)

05 C 4005 C 8568 Q 2068 Q 2268 Q 2568 R 10

Copyright information

© Akadémiai Kiadó 1992

Authors and Affiliations

  • Gary L. Miller
    • 1
  • Vijaya Ramachandran
    • 2
  1. 1.School of Computer ScienceCarnegie Mellon UniversityPittsburghUSA
  2. 2.Department of Computer SciencesUniversity of TexasAustinUSA