A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints

The k-edge-connectivity augmentation problem with bipartition constraints (kECABP, for short) is defined by “Given an undirected graph G=(V,E) and a bipartition π={VB,VW} of V with VB∩VW=∅, find an edge set Ef of minimum cardinality, consisting of edges that connect VB and VW, such that G'=(V,E∪Ef) is k-edge-connected.” The problem has applications for security of statistical data stored in a cross tabulated table, and so on. In this paper we propose a fast algorithm for finding an optimal solution to (σ+1)ECABP in O(|V||E|+|V2|log |V|) time when G is σ-edge-connected (σ > 0), and show that the problem can be solved in linear time if σ ∈ {1,2}.

[1]  Wei-Kuan Shih,et al.  Smallest Bipartite Bridge-Connectivity Augmentation , 2007, Algorithmica.

[2]  Hiroshi Nagamochi,et al.  Constructing a cactus for minimum cust og a graph in O(mn+n2log n) time and O(m) space , 2003 .

[3]  T. Ibaraki,et al.  A linear time algorithm for computing 3-edge-connected components in a multigraph , 1992 .

[4]  Toshimasa Watanabe,et al.  A 2-Approximation Algorithm to (k + 1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[5]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[6]  Toshihide Ibaraki,et al.  A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs , 2000, Algorithmica.

[7]  Tibor Jordán,et al.  Edge-connectivity augmentation with partition constraints , 1998, SODA '98.

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

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

[10]  Robert E. Tarjan,et al.  A Note on Finding the Bridges of a Graph , 1974, Inf. Process. Lett..

[11]  Yung H. Tsin.  Yet another optimal algorithm for 3-edge-connectivity , 2009, J. Discrete Algorithms.

[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]  Satoshi Taoka,et al.  A Linear-Time Algorithm for Computing All 3-Edge-Connected Components of a Multigraph , 1992 .

[15]  Tsan-sheng Hsu,et al.  The bridge-connectivity augmentation problem with a partition constraint , 2010, Theor. Comput. Sci..