Maintaining the classes of 4-edge-connectivity in a graph on-line

Algorithmica (New York)

Volumn 20, Issue 3, 1998, Pages 242-276

  Dinitz, Ye ^a   Westbrook, J ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Analysis of algorithms; Component; Connectivity class; Dynamic algorithm; Dynamic data structure; Edge connectivity; Graph algorithm

Indexed keywords

EID: 0004635641     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009195     Document Type: Article

References (36)

1. Bixby, R. E. The minimum number of edges and vertices in a graph with edge connectivity n and m n-bonds. Networks 5 (1975), 253-298.
2. Battista, G. Di, and Tamassia, R. On-line graph algorithms with SPQR-trees. Proc. 17th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 443. Springer-Verlag, Berlin, 1990, pp. 598-611.
3. Cormen, T., Leiserson, C., and Rivest, R. Introduction to Algorithms. McGraw-Hill, New York, 1990.
4. Dinitz, Ye. The 3-edge-components and the structural description of all 3-edge-cuts in a graph. Proc. 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 92). Lecture Notes in Computer Science, vol. 657. Springer-Verlag, Berlin, 1993, pp. 145-157.
5. Dinitz, Ye. Maintaining the 4-edge-connected components of a graph on-line. Proc. 2nd Israel Symp. on Theory of Computing and Systems (ISTCS 93). IEEE Computer Society Press, New York, 1993, pp. 88-97.
6. Dinitz, Ye. Modeling bottlenecks (edge cuts) of a network, with incremental maintenance. Lecture held at the Dagstuhl Seminar "Graph Algorithms and Applications" (9620), 13.5-17.5. 1996, Schloss-Dagstuhl, Wadern, Germany.
7. Dinic, E. A., Karzanov, A. V., and Lomonosov, M. V. On the structure of the system of minimum edge cuts in a graph. In Studies in Discrete Optimization, A. A. Fridman (ed.). Nauka, Moscow, 1976, pp. 290-306 (in Russian).
8. Dinitz, Ye., and Nutov, Z. A 2-level cactus model for the minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. Proc. 27th Annual ACM Symp. on Theory of Computing, 1995, pp. 509-518
9. Dinitz, Ye., and Nutov, Z. Cactus tree type models for families of bisections of a set. Manuscript, 1996.
10. Dinitz, Ye., and Vainshtein, A. The connectivity carcass of a vertex subset in a graph and its incremental maintenance. Proc. 26th Annual ACM Symp. on Theory of Computing, 1994, pp. 716-725.
11. Eppstein, D., Galil, Z., Italiano, G. F., and Nissenzweig, A. Sparsification - a technique for speeding up dynamic graph algorithms. Proc. 33rd Annual Symp. on Foundations of Computer Science, 1992, pp. 60-69.
12. Gabow, H. N. Application of a poset representation to edge connectivity and graph rigidity. Proc. 32nd Annual Symp. on Foundations of Computer Science, 1991, pp. 812-820.
13. Gomory, R. E., and Hu, T. C. Multi-terminal network flows. J. SIAM 9(4) (1961), 551-570.
14. Galil, Z., and Italiano, G. F. Reducing edge connectivity to vertex connectivity. SIGACT News 22(1) (1991), 57-61.
15. Galil, Z., and Italiano, G. F. Maintaining the 3-edge-connected classes of a graph on-line. SIAM J. Comput. 22(1) (1993), 11-28.
16. Harary, F. Graph Theory. Addison-Wesley, Reading, MA, 1972.
17. Henzinger, M. R. Approximating minimum cuts under insertions. Proc. 22nd International Colloquium on Automata, Languages and Programming (ICALP '95). Lecture Notes in Computer Science, vol. 944. Springer-Verlag, Berlin, 1995, pp. 280-291.
18. Hopcroft, J., and Tarjan, R. E. Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973), 135-158.
19. Karger, D. Using randomized sparsification to approximate minimum cuts. Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 424-432.
20. Karzanov, A. V., and Timofeev, E. A. Efficient algorithm for finding all minimal edge-cuts of a non-oriented graph. Cybernetics (1986), 156-162.
21. (Translated from Kibernetica, No. 2 (1986), 8-12.)
22. Kanevsky, A., Tamassia, R., Battista, G. Di, and Chen, J. On-line maintenance of the four-connected components of a graph. Proc. 32nd Annual Symp. on Foundations of Computer Science, 1991, pp. 793-801.
23. La Poutré, J. A. Maintenance of 2- and 3-connected components of graphs, part II: 2-and 3-edge-connected components and 2-vertex-connected components. Technical Report RUU-CS-90-27, Utrecht University, 1990.
24. La Poutré, J. A. Maintenance of triconnected components of graphs. Proc. International Colloquium on Automata, Languages, and Programming (ICALP '92). Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, 1992, pp. 354-365.
25. La Poutré, J. A., van Leeuwen, J., and Overmars, M. H. Maintenance of 2- and 3-edge-connected components of graphs. Discrete Math. 114 (1993), 329-359.
26. Naor, D. Private communication, 1991.
27. Nagamochi, H., and Ibaraki, T. Linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7 (1992), 583-596.
28. Nagamochi, H., and Kameda, T. Canonical cactus representation for minimum cuts. Japan J. Ind. Appl. Math. 11(3) (1994), 343-361.
29. Sleator, D. D., and Tarjan, R. E. Self-adjusting binary search trees. J. Assoc. Comput. Mach. 32 (1985), 652-686.
30. Tutte, W. T. Connectivity in Graphs, University of Toronto Press, Toronto, 1966.
31. Tarjan, R. E., and Leeuwen, J. van. Worst case analysis of set union algorithms. J. Assoc. Comput. Mach. 31 (1984), 245-281.
32. Westbrook, J. Algorithms and data structures for dynamic graph problems. Ph.D. thesis, Department of Computer Science, Princeton University, Princeton, NJ, October 1989.
33. Westbrook, J. Fast incremental planarity testing. Proc. International Symp. on Automata, Languages and Programming (ICALP '92). Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, 1992, pp. 342-353.
34. Westbrook, J. A simple tree data structure for on-line problems. Technical Report YALEU/DCS/TR-910, Yale University, April 1992.
35. Westbrook, J. Incremental algorithms for four-edge connectivity. Extended abstract of the lecture held at the CS seminar of Bell Labs on March 10, 1993.
36. Westbrook, J., and Tarjan, R. E. Maintaining bridge-connected and biconnected components on-line. Algorithmica 1 (1992), 433-464.