A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity

Journal of Algorithms

Volumn 24, Issue 1, 1997, Pages 194-220

  Henzinger, Monika Rauch ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346581426     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0855     Document Type: Article

References (23)

1. J. Cheriyan, M. Y. Kao, and R. Thurimella, Scan-first search and sparse certificates - An improved parallel algorithm for k-vertex connectivity, SIAM J. Comput. 22 (1993), 157-174.
2. E. A. Dinic, A. V. Karzanov, and M. V. Lomonosov, A structure of the system of all minimal cuts of a graph, in "Studies in Discrete Optimization" (A. A. Fridman, Ed.), pp. 290-306, Nauka, Moscow, 1976. (in Russian)
3. Ye. Dinitz and Z. Nutov, A 2-level cactus model for the system of minimum and minimum + 1 edge-cuts in a graph and its incremental maintenance, in "Proceedings, 27nd Symposium on Theory of Computing, 1995." [To appear]
4. Ye. Dinitz and J. Westbrook, "Maintaining the Classes 4-Edge-Connectivity of a Graph On-Line," Technical Report 871, Department of Computer Science, Technion, Israel, 1995.
5. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, Sparsification - A technique for speeding up dynamic graph algorithms, in "Proceedings, 33rd Symposium on Foundations of Computer Science, 1992," pp. 60-69.
6. S. Even, An algorithm for determining whether the connectivity of a graph is at least k, SIAM J. Comput. 4 (1975), 393-396.
7. S. Even, G. Itkis, and S. Rajsbaum, On mixed connectivity certificates, in "Algorithms - ESA'95, Proceedings, 3rd European Symposium" Lecture Notes in Computer Science, Vol. 979, pp. 1-16, Springer-Verlag, Berlin/New York, 1995.
8. S. Even and R. E. Tarjan, Network flow and testing graph connectivity, SIAM J. Comput. 4 (1975), 507-518.
9. H. N. Gabow, A matroid approach to finding edge connectivity and packing arborescences, in "Proceedings, 23rd Symposium on Theory of Computing, 1991," pp. 112-122.
10. H. N. Gabow, Applications of a poset representation to edge connectivity and graph rigidity, in "Proceedings, 32nd Symposium on Foundations of Computer Science, 1991," pp. 812-821.
11. Z. Galil, Finding the vertex connectivity of graphs, SIAM J. Comput. (1980), 197-199.
12. Z. Galil and G. P. Italiano, Maintaining the 3-edge-connected components of a graph on-line, SIAM J. Comput. (1993), 11-28.
13. A. Ya. Gordon, One algorithm for the solution of the minimax assignment problem, in "Studies in Discrete Optimization (A. A. Fridman, Ed.), pp. 327-333, Nauka, Moscow, 1976. [In Russian]
14. F. Harary, "Graph Theory," Addison-Wesley, Reading, MA, 1969.
15. D. Karger, Using randomized sparsification to approximate minimum cuts, in "Proceedings, 5th Symposium on Discrete Algorithms, 1994," pp. 424-432.
16. D. Karger, Random sampling in cut, flow, and network design problems, in "Proceedings, 26rd Symposium on Theory of Computing, 1994," pp. 648-657.
17. H. La Poutré, "Maintenance of 2- and 3-Connected Components of Graphs. II. 2- and 3-Edge-Connected Components and 2-Vertex-Connected Components," Technical Report RUU-CS-90-27, Utrecht University, 1990.
18. D. W. Matula, A linear time 2 + ∈ approximation algorithm for edge connectivity, in "Proceedings, 4th Symposium on Discrete Algorithms, 1993," pp. 500-504.
19. K. Menger, Zur allgemeinen Kurventheorie, Fund. Math. 10 (1927), 96-115.
20. H. Nagamochi and T. Ibaraki, Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica 7 (1992), 583-596.
21. D. D. Sleator, R. E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 24 (1983), 362-381.
22. J. Westbrook and R. E. Tarjan, Maintaining bridge-connected and biconnected components on-line, Algorithmica 7, No. 516 (1992), 433-464.
23. H. Whitney, Non-separable and planar graphs, Trans. Amer. Math. Soc. 34 (1932), 339-362.