Augmenting undirected connectivity in RNC and in randomized Õ(n3) time

undirected connectivity in RNC and in randomized ~ (n3) time Andrfis A. Bencztir* Department of Mathematics

[1]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[2]  Harold N. Gabow,et al.  Applications of a poset representation to edge connectivity and graph rigidity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[3]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[4]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[5]  Akira Nakamura,et al.  Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..

[6]  David R. Karger,et al.  Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[7]  Harold N. Gabow.  A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.

[8]  Guo-Ray Cai,et al.  The minimum augmentation of any graph to a K-edge-connected graph , 1989, Networks.

[9]  Harold N. Gabow,et al.  Efficient splitting off algorithms for graphs , 1994, STOC '94.

[10]  James B. Orlin,et al.  A faster algorithm for finding the minimum cut in a graph , 1992, SODA '92.

[11]  András Frank.  Augmenting Graphs to Meet Edge-Connectivity Requirements , 1992, SIAM J. Discret. Math..

[12]  E. A. Timofeev,et al.  Efficient algorithm for finding all minimal edge cuts of a nonoriented graph , 1986 .

[13]  David R. Karger,et al.  An Õ(n2) algorithm for minimum cuts , 1993, STOC.

[14]  Vijay V. Vazirani,et al.  Representing and Enumerating Edge Connectivity Cuts in RNC , 1991, WADS.