Finding the Triconnected Components of a Graph
John E. Hopcroft, Robert Endre Tarjan · Defense Technical Information Center (DTIC) · 1972
An algorithm for decomposing a graph into triconnected components is presented. The algorithm requires 0(V + E) time and space when implemented on a random access computer, where V is the number of vertices and E is the number of edges in the graph. The algorithm is both theoretically optimal (to within a constant factor) and efficient in practice.