A fast algorithm for optimally increasing the edge connectivity

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 1139-1165

  Naor, Dalit ^a,b   Gusfield, Dan ^a   Martel, Charles ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

Graph algorithms; Graph connectivity; Minimum cuts; Network flow

Indexed keywords

GRAPH THEORY; NUMBER THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

EDGE AUGMENTATION PROBLEM; GRAPH ALGORITHMS; GRAPH CONNECTIVITY;

ALGORITHMS;

EID: 0031210032     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792234226     Document Type: Article

References (38)

1. G. M. ADELSON-VELSKII, E. A DINITS, AND A. V. KARZANOV, Flow Algorithms, Nauka, Moscow, 1976 (in Russian).
2. R. K. AHUJA, T. L. MAGNANTI, AND J. B. ORLIN, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, New Jersey, 1993.
3. J. BANG-JENSEN AND B. JACKSON, Minimal augmentation and vertex splitting in mixed graphs, Preprints 5, Institut for Matematik og Datalogi, Odense Universitet, Odense, Denmark, 1992.
4. R. E. BIXBY, The minimum number of edges and vertices in a graph with edge connectivity n and m n-bonds, Networks, 5 (1975), pp. 253-298.
5. G. R. CAI AND Y. G. SUN, The minimum augmentation of any graph to a k-edge-connected graph, Networks, 19 (1989), pp. 151-172.
6. E. A. DINITS, A. V. KARZANOV, AND M. L. LOMOSONOV, On the structure of a family of minimal weighted cuts in a graph, in Studies in Discrete Optimization, A. A. Fridman, ed., Nauka, Moscow, 1976, pp. 290-306 (in Russian).
7. K. ESWARAN AND R. E. TARJAN, Augmentation problems, SIAM J. Comput., 5 (1976), pp. 653-665.
8. S. EVEN AND R. E. TARJAN, Network flow and testing graph connectivity, SIAM J. Comput., 4 (1975), pp. 507-518.
9. A. FRANK, Augmenting graphs to meet edge connectivity requirements, SIAM J. Discrete Math., 5 (1992), pp. 25-53.
10. G. N. FREDRICKSON AND J. JÁJÁ, Approximation algorithms for several graph augmentation problems, SIAM J. Comput., 10 (1981), pp. 270-183.
11. H. N. GABOW, Applications of a poset representation to edge connectivity and graph rigidity, in Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 812-821.
12. A. V. GOLDBERG AND D. GUSFIELD, Book review: Flow Algorithms, by G. M. Adelson-Velskii, E. A Dinitz, and A. V. Karzanov, SIAM Rev., 33 (1991), pp. 306-314.
13. R. E. GOMORY AND T. C. HU, Multi-terminal network flows, SIAM J. Appl. Math., 9 (1961), pp. 551-560.
14. M. GROTSCHEL, C. MONMA, AND M. STOER, Polyhedral approaches to network survivability, Report 189, Institut fur Mathematik, Universitat Augsburg, Augsburg, Germany, 1990.
15. M. GROTSCHEL, C. MONMA, AND M. STOER, Computational results with a cutting plane, algorithm for designing communication networks with low-connectivity constraints, Oper. Res., 40 (1992), pp. 309-330.
16. M. GROTSCHEL, C. MONMA, AND M. STOER, Facets of polyhedra arising in the design of communication networks with low-connectivity constraints, Technical Report 90-40, DIMACS, Rutgers University, Piscataway, NJ, 1990.
17. D. GUSFIELD, Optimal mixed graph augmentation, SIAM J. Comput., 16 (1987), pp. 599-612.
18. D. GUSFIELD, Very simple methods for all pairs network flow analysis, SIAM J. Comput., 19 (1990), pp. 143-155.
19. D. GUSFIELD, A graph theoretic approach to statistical data security, SIAM J. Comput., 17 (1988), pp. 552-571.
20. T. S. HSU AND V. RAMACHANDRAN, On finding a smallest augmentation to biconnect a graph, Technical Report TR-91-12, University of Texas at Austin, Austin, TX, 1991.
21. T. S. HSU AND V. RAMACHANDRAN, A linear time algorithm for triconnectivity augmentation, in Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 548-559.
22. Y. KAJITANI AND S. UENO, The minimum augmentation of a directed tree to a strongly k-edge-connected directed graph, Networks, 16 (1986), pp. 181-197.
23. A. KANEVSKY, Graphs with odd and even edge connectivity are inherently different, Technical Report TAMU-89-10, Texas A&M University, College Station, TX, 1989.
24. A. V. KARZANOVAND E. A. TIMOFEEV, Efficient algorithm for finding all minimal edge cuts of a nonoriented graph, Kibernet., 2 (1986), pp. 8-12 (in Russian); Cybernetics, 2 (1986), pp. 156-162 (in English).
25. A. V. KARZANOVAND E. A. TIMOFEEV, Efficient algorithm for finding all minimal edge cuts of a nonoriented graph, Kibernet., 2 (1986), pp. 8-12 (in Russian); Cybernetics, 2 (1986), pp. 156-162 (in English).
26. U. MANBER, Introduction to Algorithms: A Creative Approach, Addison-Wesley, Reading, MA, 1989.
27. D. MATULA, Determining edge connectivity in O(nm), in Proc. 28th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1987, pp. 249-251.
28. H. NAGAMOCHI AND T. IBARAKI, A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, 7 (1992), pp. 583-596.
29. D. NAOR, The structure of minimum cuts with applications to edge-augmentation, Ph.D. thesis, Department of Computer Science, University of California at Davis, Davis, CA, 1991.
30. D. NAOR AND V. V. VAZIRANI, Representing and enumerating edge connectivity cuts in ℛscript N signscript C sign, in Algorithms and Data Structures, Proc. 2nd Workshop WADS, F. Dehne, J. R. Sack, and N. Santaro, eds., Lecture Notes in Comput. Sci. 519, Springer-Verlag, Berlin, pp. 273-285.
31. D. NAOR, D. GUSFIELD, AND C. MARTEL, A fast algorithm for optimally increasing the edge-connectivity, in Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 698-707.
32. V. D. PODDERYUGIN, An algorithm for finding the edge connectivity of graphs, Vopr. Kibernet., 2 (1973), p. 136.
33. A. ROSENTHAL, AND A. GOLDNER, Smallest augmentation to biconnect a graph, SIAM J. Comput., 6 (1977), pp. 55-66.
34. R. E. TARJAN, Depth first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
35. S. UENO, Y. KAJITANI, AND H. WADA, Minimum augmentation of a tree to a k-edge-connected graph, Networks, 18 (1988), pp. 19-25.
36. T. WATANABE, An efficient augmentation to k-edge-connect a graph, Technical Report C-23, Department of Applied Mathematics, Hiroshima University, Hiroshima, Japan, 1988.
37. T. WATANABE AND A. NAKAMURA, Edge-connectivity augmentation problems, J. Comput. System Sci., 35 (1987), pp. 96-144.
38. T. WATANABE AND A. NAKAMURA, 3-connectivity augmentation problems, Proc. 1988 IEEE International Symposium on Circuits and Systems, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 1847-1850.