Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation

Journal of Algorithms

Volumn 33, Issue 1, 1999, Pages 15-50

  Cheriyan, Joseph ^a   Thurimella, Ramakrishna ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF DENVER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (37)

1. D. Bienstock, E. F. Brickell, and C. L. Monma, On the structure of minimum-weight k-connected spanning networks, SIAM J. Discrete Math. 3 (1990), 320-329.
2. 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.
3. T. H. Cormen, C. E. Leiserson and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
4. R. Diestel, A separation property of planar triangulations, J. Graph Theory 11 (1987), 43-52.
5. R. Diestel, "Graph Theory," Graduate Texts in Mathematics, Vol. 173, Springer-Verlag, New York, 1997.
6. K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Comput. 5 (1976), 653-665.
7. S. Even, "Graph Algorithms," Comput. Sci. Press, Potomac, MD, 1979.
8. A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Disc. Math. 5 (1992), 25-53.
9. A. Frank, On a theorem of Mader, Ann. Discrete Math. 101 (1992), 49-57.
10. A. Frank, Submodular functions in graph theory, Discrete Math. 111 (1993), 231-243.
11. A. Frank, Connectivity augmentation problems in network design, in "Mathematical Programming: State of the Art 1994" (J. R. Birge and K. G. Murty, Eds.), pp. 34-63, University of Michigan, Ann Arbor, MI, 1994.
12. A. Frank, T. Ibaraki, and H. Nagamochi, On sparse subgraphs preserving connectivity properties, J. Graph Theory 17 (1993), 275-281.
13. A. Frank and T. Jordán, Minimal edge-coverings of pairs of sets, J. Combin. Theory Ser. B 65 (1995), 73-110.
14. A. Frank and T. Jordán, How to make a strongly connected digraph two-connected, in "Proc. 4th I.P.C.O." (E. Balas and J. Clausen, Eds.), LNCS 920, pp. 414-425, Springer-Verlag, Berlin, 1995.
15. Z. Galil, Finding the vertex connectivity of graphs, SIAM J. Comput. 9 (1980), 197-199.
16. J. F. Geelen, personal communication, August 1996.
17. M. X. Goemans and D. P. Williamson, The primal-dual method for approximation algorithms and its application to network design problems, in "Approximation Algorithms for NP-hard Problems" (D. S. Hochbaum, Ed.), PWS, Boston, MA, 1995.
18. T. Hsu, On four-connecting a triconnected graph, in "Proc. 33rd IEEE F.O.C.S., 1992," pp. 70-79.
19. T. Hsu, Unidirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation, Proc. 6th ISAAC (1995).
20. T. Hsu and V. Ramachandran, A linear time algorithm for triconnectivity augmentation, in "Proc. 32nd IEEE F.O.C.S., 1991," pp. 548-559.
21. T. Hsu and V. Ramachandran, Finding a smallest augmentation to biconnect a graph, SIAM J. Comput. 22 (1993), 889-912.
22. M. R. Henzinger, S. Rao, and H. N. Gabow, Computing vertex connectivity: new bounds from old techniques, "Proc. 37th IEEE F.O.C.S. (1996)," pp. 462-471.
23. T. Jordán, Increasing the vertex-connectivity in directed graphs, in "Proc. Algorithms - ESA'93, 1st Annual European Symposium," LNCS 726, pp. 236-247, Springer, New York, 1993.
24. T. Jordán, On the optimal vertex-connectivity augmentation, J. Combin. Theory Ser. B 63 (1995), 8-20. [Preliminary version in "Proc. 3rd I.P.C.O.," 1993, pp. 75-88].
25. T. Jordán, On the optimal vertex-connectivity augmentation, J. Combin. Theory Ser. B 63 (1995), 8-20. [Preliminary version in "Proc. 3rd I.P.C.O.," 1993, pp. 75-88].
26. T. Jordán, A note on the vertex-connectivity augmentation problem, J. Combin. Theory Ser. B 71 (1997), 294-301.
27. T. Jordán, On the number of shredders, J. Graph Theory 31 (1991), 195-200.
28. A. Kanevsky, Finding all the minimum-size separating vertex sets in a graph, Networks 23 (1993), 533-541.
29. D. Karger, A randomized fully polynomial time approximation scheme for the all terminal network reliability problem, in "Proc. 27th ACM S.T.O.C., 1995," pp. 11-17.
30. L. Lovász, Lecture at "Conference in Graph Theory, Prague, 1974."
31. W. Mader, A reduction method for edge-connectivity in graphs, Ann. Discrete Math. 3 (1978), 145-164.
32. W. Mader, Konstruktion aller n-fach kantenzusammenhängenden Digraphen, Europ. J. Combin. 3 (1982), 63-67.
33. 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), 583-596.
34. J. S. Provan and M. O. Ball, The complexity of counting cuts and of computing the probability that a graph is connected, SIAM J. Comput. 12 (1983), 777-788.
35. R. Ravi and D. P. Williamson, An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica 18 (1997), 21-43. [Preliminary version in "Proc. 6th ACM-SIAM SODA, 1995," pp. 332-341]
36. R. Ravi and D. P. Williamson, An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica 18 (1997), 21-43. [Preliminary version in "Proc. 6th ACM-SIAM SODA, 1995," pp. 332-341]
37. T. Watanabe and A. Nakamura, A smallest augmentation to 3-connect a graph, Discrete Appl. Math. 28 (1990), 183-186.