On-Line Maintenance of Triconnected Components with SPQR-Trees

Algorithmica (New York)

Volumn 15, Issue 4, 1996, Pages 302-318

  Di Battista, G ^a   Tamassia, R ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b Brown Univerity   (United States)

Author keywords

Dynamic algorithm; Dynamic data structure; Graph decomposition; Network reliability; Tri connected components; Vertex connectivity

Indexed keywords

EID: 1542577522     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01961541     Document Type: Article

References (14)

1. G. Di Battista and R. Tamassia, Incremental Planarity Testing, Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 436-441.
2. G. Di Battista and R. Tamassia, On-Line Planarity Testing, SIAM Journal on Computing, 25(5) (1996, to appear.
3. D. Fussell, V. Ramachandran, and R. Thurimella, Finding Triconnected Components by Local Replacements, Automata, Languages and Programming (Proc. 16th ICALP), Lecture Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin, 1989, pp. 379-393.
4. H. N. Gabow and R. E. Tarjan, A Linear Time Algorithm for a Special Case of Disjoint Set Union, J. Comput. Systems Sci., 30 (985), 209-221.
5. J. Hopcroft and R. E. Tarjan, Dividing a Graph into Triconnected Components, SIAM J. Comput., 2 (1973), 135-158.
6. H. Imai and T. Asano, Dynamic Orthogonal Segment Intersection Search, J. Algorithms, 8 (1987), 1-18.
7. A. Kanevsky, A Characterization of Separating Pairs and Triplets in a Graph, Congress. Numer., 74 (1990), 213-232.
8. J. A. La Poutré, Maintenance of Triconnected Components of Graphs, Automata, Languages and Programming (Proc. 19th ICALP), Lecture Notes in Computer Science, Vol. 623, Springer-Verlag, Berlin, 1992, pp. 354-365.
9. R. Tamassia, On-Line Planar Graph Embedding, J. Algorithms (to appear). (Preliminary version in Proc. 15th ICALP, Lecture Notes in Computer Science, Vol. 317, Springer-Verlag, Berlin, 1988, pp. 576-590.)
10. R. Tamassia, On-Line Planar Graph Embedding, J. Algorithms (to appear). (Preliminary version in Proc. 15th ICALP, Lecture Notes in Computer Science, Vol. 317, Springer-Verlag, Berlin, 1988, pp. 576-590.)
11. R. E. Tarjan, Amortized Computational Complexity, SIAM J. Algebraic Discrete Methods, 6 (1985), 306-318.
12. R. E. Tarjan and J. van Leeuwen, Worst-Case Analysis of Set-Union Algorithms, J. Assoc. Comput. Mach., 31 (1984), 245-281.
13. W. T. Tutte, Graph Theory, Encyclopedia of Mathematics and Its Applications, Vol. 21, Addison-Wesley, Reading, MA, 1984.
14. J. Westbrook and R. E. Tarjan, Maintaining Bridge-Connected and Biconnected Components On-Line, Algorithmica, 7 (1992), 433-464.