Parallel and fast sequential algorithms for undirected edge connectivity augmentation

1,E2,..., such that ⋃i≤τEi optmially increases the connectivity by τ, for any integer τ. The main result of the paper is that this sequence of edge sets can be divided into O(n) groups such that within one group, all Ei are basically the same. Using this result, we improve on the running time of edge connectivity augmentation, as well as we give the first parallel (RNC) augmentation algorithm. We also present new efficient subroutines for finding the so-called extreme sets and the cactus representation of min-cuts required in our algorithms. Augmenting the connectivity of hypergraphs with ordinary edges is known to be structurally harder than that of ordinary graphs. In a weaker version when one exceptional hyperedge is allowed in the augmenting edge set, we derive similar results as for ordinary graphs.

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

[2]  Zoltán Szigeti.  Hypergraph connectivity augmentation , 1999, Math. Program..

[3]  David R. Karger,et al.  A new approach to the minimum cut problem , 1996, JACM.

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

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

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

[7]  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.

[8]  David R. Karger,et al.  Augmenting undirected edge connectivity in Õ(n2) time , 2000, SODA '98.

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

[10]  Robert E. Tarjan,et al.  Network Flow Algorithms , 1989 .

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

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

[13]  Charles U. Martel,et al.  A Fast Algorithm for Optimally Increasing the Edge Connectivity , 1997, SIAM J. Comput..

[14]  András A. Benczúr,et al.  Cut structures and randomized algorithms in edge-connectivity problems , 1997 .

[15]  Tibor Jordán,et al.  Coverings and structure of crossing families , 1999, Math. Program..

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

[17]  Mikhail J. Atallah,et al.  Finding Euler Tours in Parallel , 2011, J. Comput. Syst. Sci..

[18]  Harold N. Gabow,et al.  A representation for crossing set families with applications to submodular flow problems , 1993, SODA '93.

[19]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[20]  András A. Benczúr,et al.  A representation of cuts within 6/5 times the edge connectivity with applications , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

[22]  A. Bencz,et al.  Covering Symmetric Supermodular Functions by Graphs + , 1998 .

[23]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

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

[25]  Jørgen Bang-Jensen,et al.  Augmenting hypergraphs by edges of size two , 1999, Math. Program..

[26]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[27]  W. Mader.  A Reduction Method for Edge-Connectivity in Graphs , 1978 .

[28]  Lisa Fleischer,et al.  Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time , 1998, J. Algorithms.

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

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

[31]  Maurice Queyranne,et al.  On the structure of all minimum cuts in a network and applications , 1982, Math. Program..

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

[33]  Eddie Cheng,et al.  Successive edge-connectivity augmentation problems , 1999, Math. Program..

[34]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .