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.
No takes yet. Share an insight, caveat, or question.
Hopcroft et al. (1973) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: