Edge-connectivity augmentation preserving simplicity

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 4, 1998, Pages 603-623

  Bang Jensen, Jørgen ^a   Jordán, Tibor ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Combinatorial optimization; Connectivity; Edge connectivity augmentation of graphs; Network design

Indexed keywords

EID: 0007058715     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197318878     Document Type: Article

References (25)

1. J. BANG-JENSEN, H. N. GABOW, T. JORDÁN, AND Z. SZIGETI, Edge-connectivity augmentation with partition constraints, in Proc. 9th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), SIAM, Philadelphia, PA, 1998, pp. 306-315.
2. J. BANG-JENSEN AND T. JORDÁN, Edge-connectivity augmentation preserving simplicity, in Proc. 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, CA, pp. 486-495.
3. A. A. BENCZÚR, Parallel and fast sequential algorithms for undirected edge augmentation, Math. Programming Ser. B, to appear.
4. 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.
5. E. CHENG AND T. JORDÁN, Successive edge-connectivity augmentation problems, Math. Programming, Ser. B, to appear.
6. K. ESWARAN AND R. E. TARJAN, Augmentation Problems, SIAM J. Comput., 5 (1976) pp. 653-665.
7. A. FRANK, On a theorem of Mader, Discrete Math., 101 (1992), pp. 49-57.
8. A. FRANK, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math., 5 (1992), pp. 25-53.
9. A. FRANK, Connectivity augmentation problems in network design, in Mathematical Programming: State of the Art, J. R. Birge and K. G. Murty, eds., The University of Michigan, Ann Arbor, MI, 1994, pp. 34-63.
10. H. FRANK AND W. CHOU, Connectivity considerations in the design of survivable networks, IEEE Trans. Circuit Theory, 17 (1970), pp. 486-490.
11. H. N. GABOW, Applications of a poset representation for edge-connectivity and graph rigidity, in Proc. 32nd IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 812-821.
12. H. N. GABOW, Efficient splitting off algorithms for graphs, in Proc. 26th Annual ACM Symposium on the Theory of Computing, ACM, New York, 1994, pp. 696-705.
13. T-S. HSU AND M-Y. KAO, Optimal augmentation for bipartite componentwise biconnectivity in linear time, in Algorithms and Computation (Proc. ISAAC '96), Lecture Notes in Comput. Sci. 1178, 1996, Springer-Verlag, New York, pp. 213-222.
14. B. JACKSON, Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs, J. Graph Theory, 12 (1988), pp. 429-436.
15. T. JORDÁN, Two NP-complete Augmentation Problems, IMADA, Odense University, Denmark, Preprint No. 8, 1997.
16. G. KANT AND H. L. BODLAENDER, Planar graph augmentation problems, in Algorithms and Data Structures (Proc. WADS '91), Lecture Notes in Comput. Sci. 519, Springer-Verlag, New York, 1991, pp. 286-298.
17. L. LOVÁSZ, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.
18. W. MADER, A Reduction Method for Edge-Connectivity in Graphs, Ann. Discrete Math., 3 (1978), pp. 145-164.
19. H. NAGAMOCHI AND P. EADES, Edge-splitting and edge-connectivity augmentation in planar graphs, in Proc. 6th Conf. on Integer Programming and Combinatorial Optimization (IPCO), Rice University, Houston, TX, 1998, to appear.
20. H. NAGAMOCHI AND T. IBARAKI, Computing edge-connectivity in multigraphs and capacitated graphs, SIAM J. Discrete Math. 5, (1992), pp. 54-66.
21. H. NAGAMOCHI AND T. IBARAKI, Deterministic Õ(nm) time edge-splitting in undirected graphs, J. Combin. Optim., 1 (1997), pp. 5-46.
22. D. NAOR, D. GUSFIELD, AND C. MARTEL, A fast algorithm for optimally increasing the edge-connectivity, SIAM J. Comput., 26 (1997), pp. 1139-1165.
23. S. TAOKA, D. TAKAFUJI, AND T. WATANABE, Simplicity preserving augmentation of the edge-connectivity of a graph, TR IEICE, 1994, pp. 49-56.
24. T. WATANABE AND M. YAMAKADO, A linear time algorithm for smallest augmentation to 3-edge-connect a graph, IEICE Trans. Fundamentals, E76-A (1993), pp. 518-530.
25. T. WATANABE AND A. NAKAMURA, Edge-connectivity augmentation problems, J. Comput. System Sci., 35 (1987), pp. 96-144.