Dividing a Graph into Triconnected Components
| dc.contributor.author | Hopcroft, John E. | en_US |
| dc.contributor.author | Tarjan, Robert Endre | en_US |
| dc.date.accessioned | 2007-04-19T19:07:26Z | |
| dc.date.available | 2007-04-19T19:07:26Z | |
| dc.date.issued | 1974-02 | en_US |
| dc.description.abstract | 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 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. | en_US |
| dc.format.extent | 1677957 bytes | |
| dc.format.extent | 517150 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-197 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6037 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Dividing a Graph into Triconnected Components | en_US |
| dc.type | technical report | en_US |