Hopcroft, John E.Tarjan, Robert Endre2007-04-192007-04-191974-02http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-197https://hdl.handle.net/1813/6037An 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 algorithms is both theoretically optimal to within a constant factor and efficient in practice. Keywords: articulation point, connectivity, depth-first search, graph, separability, separation, triconnectivity.1677957 bytes517150 bytesapplication/pdfapplication/postscripten-UScomputer sciencetechnical reporttechnical report