We hope this content on epidemiology, disease modeling, pandemics and vaccines will help in the rapid fight against this global problem. Click on title above or here to access this collection. An algorithm for dividing a graph into triconnected components is presented. The algorithm is both theoretically optimal to within a constant factor and efficient in practice. You can also purchase online an Individual or Institutional Subscription to this journal or buy one or more printed volumes. Note : Fulfillment of a Subscription including online Activation may take several business days.
|Published (Last):||12 October 2005|
|PDF File Size:||4.24 Mb|
|ePub File Size:||19.83 Mb|
|Price:||Free* [*Free Regsitration Required]|
Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. DOI: Hopcroft and Robert E. Hopcroft , Robert E. An algorithm for dividing a graph into triconnected components is presented. The algorithm is both theoretically optimal to within a constant factor and efficient in practice.
View via Publisher. Save to Library. Create Alert. Launch Research Feed. Share This Paper. Figures and Topics from this paper. Citations Publications citing this paper. Combinatorial Algorithms Chi.
Leung , Ananthram Swami , Donald F. References Publications referenced by this paper. Circuit Theory. Efficient Planarity Testing John E. An efficient planarity algorithm Robert E. Tarjan Computer Science Tarjan Mathematics Isomorphism ofplanar graphs. Decomposition of a graph into compactly connected two-terminal subgraphs Hiromu Ariyoshi , Isao Shirakawa , Hiroshi Ozaki Mathematics Efficient algorithms for graph manipulation John E. Methods for investigating the connectivity of large graphs Daniel J.
Dividing a Graph into Triconnected Components
In graph theory , a branch of mathematics, the triconnected components of a biconnected graph are a system of smaller graphs that describe all of the 2-vertex cuts in the graph. An SPQR tree is a tree data structure used in computer science , and more specifically graph algorithms , to represent the triconnected components of a graph. The SPQR tree of a graph may be constructed in linear time  and has several applications in dynamic graph algorithms and graph drawing. An SPQR tree takes the form of an unrooted tree in which for each node x there is associated an undirected graph or multigraph G x. The node, and the graph associated with it, may have one of four types, given the initials SPQR:.
John E. Hopcroft 62 Estimated H-index: Estimated H-index: Find in Lib.