Decremental 2- and 3-Connectivity on Planar Graphs

Algorithmica (New York)

Volumn 16, Issue 3, 1996, Pages 263-287

  Giammarresi, D ^a   Italiano, G F ^b,c  

^a UNIVERSITY OF PALERMO   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Analysis of algorithms; Dynamic data structures; Edge connectivity; Planar graphs; Vertex connectivity

Indexed keywords

EID: 0346795020     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01955676     Document Type: Article

References (21)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. G. Di Battista and R. Tamassia. On-line graph algorithms with SPQR-trees. Proc. 17th International Colloquium on Automata, Languages and Programming, pages 598-611. Lecture Notes in Computer Science, Volume 443, Springer-Verlag, Berlin, 1990.
3. E. A. Dinic, A. V. Karzanov, and M. V. Lomonosov. On the structure of the system of minimal edge cuts in a graph. In A. A. Fridman (ed.), Studies in Discrete Optimization, pages 290-306. Nauka, Moskow, 1976 (in Russian).
4. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification - a technique for speeding up dynamic graph algorithms. Proc. 33rd Annual Symposium on the Foundations of Computer Science, pages 60-69, 1992.
5. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms, 13:33-54, 1992.
6. S. Even and Y. Shiloach. An on-line edge deletion problem. J. Assoc. Comput. Mach., 28:1-4, 1981.
7. G. N. Frederickson. Data structures for on-line updating of minimum spanning trees. SIAM J. Comput., 14: 781-798, 1985.
8. G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. Proc. 32nd Annual Symposium on the Foundations of Computer Science, pages 632-641, 1991.
9. Z. Galil and G. F. Italiano. Maintaining biconnected components of dynamic planar graphs. Proc. 18th International Colloquium on Automata, Languages and Programming, pages 339-350. Lecture Notes in Computer Science, Volume 510, Springer-Verlag, Berlin, 1991.
10. Z. Galil and G. F. Italiano. Fully dynamic algorithms for 2-edge-connectivity. SIAM J. Comput., 21:1047-1049, 1992.
11. Z. Galil and G. F. Italiano. Maintaining the 3-edge-connected components of a graph on-line. SIAM J. Comput., 22:11-28, 1993.
12. D. Giammarresi, and G. F. Italiano, Dynamic 2- and 3-connectivity on planar graphs. Proc. 3rd Scandinavian Workshop on Algorithm Theory, pages 221-232. Lecture Notes in Computer Science, Volume 621, Springer-Verlag, Berlin, 1992.
13. L. Guibas and J. Stolfi. Primitives for the manipulation of general subdivision and the computation of Voronoi diagrams. ACM Trans. Graphics, 4:74-123, 1985.
14. J. Hershberger, M. Rauch, and S. Suri. Fully dynamic 2-connectivity on planar graphs. Proc. 3rd Scandinavian Workshop on Algorithm Theory, pages 233-244. Lecture Notes in Computer Science, Volume 621, Springer-Verlag, Berlin, 1992.
15. A. Kanevsky, R. Tamassia, G. Di Battista, and J. Chen. On-line maintenance of the four-connected components of a graph. Proc. 32nd Annual Symposium on the Foundations of Computer Science, pages 793-801, 1991.
16. J. A. La Poutré. Dynamic graph algorithms and data structures. Ph.D. thesis, Department of Computer Science, Utrecht University, September 1991.
17. J. A. La Poutré. Maintenance of triconnected components of graphs. Proc. 19th International Colloquium on Automata, Languages and Programming, pages 354-365. Lecture Notes in Computer Science, Volume 623, Springer-Verlag, Berlin, 1992.
18. J. A. La Poutré, J. van Leeuwen, and M. H. Overmars. Maintenance of 2- and 3-edge-connected components of graphs, I. Discrete Math., 114:329-359, 1993.
19. M. Rauch. Fully dynamic biconnectivity in graphs. Proc. 33rd IEEE Symposium on the Foundations of Computer Science, pages 50-59, 1992.
20. M. Rauch. Improved data structures for fully dynamic biconnectivity. Proc. 26th ACM Symposium on the Theory of Computing, pages 686-695, 1994.
21. J. Westbrook and R. E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433-464, 1992.