Publication | Closed Access
Dividing a Graph into Triconnected Components
836
Citations
4
References
1973
Year
Cluster ComputingEngineeringNetwork AnalysisComputational ComplexityGraph ProcessingStructural Graph TheorySystems EngineeringParallel ComputingCombinatorial OptimizationComputational GeometryRandom Access ComputerSocial Network AnalysisGraph AlgorithmsComputer EngineeringConstant FactorComputer ScienceGraph AlgorithmNetwork ScienceGraph TheoryNetwork AlgorithmTriconnected ComponentsBusinessParallel ProgrammingGraph Analysis
An algorithm for dividing a graph into triconnected components is presented. When implemented on a random access computer, the algorithm requires $O(V + E)$ time and space to analyze a graph with V vertices and E edges. The algorithm is both theoretically optimal to within a constant factor and efficient in practice.
| Year | Citations | |
|---|---|---|
Page 1
Page 1