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

A k-separator (k-shredder) of a k-node connected undirected graph is a set of k nodes whose removal results in two or more (three or more) connected components. Let n denote the number of nodes. Solving an open question, we show that the problem of counting the number of k-separators is #P-complete. However, we present an O(k2n2+k3n1.5)-time (deterministic) algorithm for finding all the k-shredders. This solves an open question: efficiently find a k-separator whose removal maximizes the number of connected components. For k?4, our running time is within a factor of k of the fastest algorithm known for testing k-node connectivity. One application of shredders is to increase the node connectivity from k to (k+1) by efficiently adding an (approximately) minimum number of new edges. Jordan (J. Combin. Theory Ser. B63 1995) gave an O(n5)-time augmentation algorithm such that the number of new edges is within an additive term of (k?2) from a lower bound. We improve the running time to O(min(k,n)k2n2), while achieving the same performance guarantee. For k?4, the running time compares favorably with the running time for testing k-node connectivity.

[1]  András Frank,et al.  How to Make a Strongly Connected Digraph Two-Connected , 1995, IPCO.

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

[3]  Tsan-sheng Hsu.  Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation , 1995, ISAAC.

[4]  Reinhard Diestel,et al.  A separation property of planar triangulations , 1987, J. Graph Theory.

[5]  András Frank,et al.  Submodular functions in graph theory , 1993, Discret. Math..

[6]  András Frank,et al.  On a theorem of Mader , 1992, Discret. Math..

[7]  András Frank,et al.  Minimal Edge-Coverings of Pairs of Sets , 1995, J. Comb. Theory B.

[8]  T. Hsu,et al.  On four-connecting a triconnected graph , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9]  David R. Karger,et al.  A randomized fully polynomial time approximation scheme for the all terminal network reliability problem , 1995, STOC '95.

[10]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

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

[12]  Zvi Galil,et al.  Finding the Vertex Connectivity of Graphs , 1980, SIAM J. Comput..

[13]  Tibor Jordán,et al.  Incresing the Vertex-Connectivity in Directed Graphs , 1993, ESA.

[14]  David R. Karger.  A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem , 1999, SIAM J. Comput..

[15]  Arkady Kanevsky,et al.  Finding all minimum-size separating vertex sets in a graph , 1993, Networks.

[16]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[17]  Tibor Jordán.  On the number of shredders , 1999 .

[18]  Wolfgang Mader,et al.  Konstruktion aller n-fach kantenzusammenhängenden Digraphen , 1982, Eur. J. Comb..

[19]  Tibor Jordán,et al.  On the Optimal Vertex-Connectivity Augmentation , 1995, J. Comb. Theory B.

[20]  Ming-Yang Kao,et al.  Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity , 1993, SIAM J. Comput..

[21]  Satish Rao,et al.  Computing vertex connectivity: new bounds from old techniques , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[22]  Akira Nakamura,et al.  A smallest augmentation to 3-connect a graph , 1990, Discret. Appl. Math..

[23]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[24]  Toshihide Ibaraki,et al.  On sparse subgraphs preserving connectivity properties , 1993, J. Graph Theory.

[25]  Tsan-sheng Hsu,et al.  On Finding a Smallest Augmentation to Biconnect a Graph , 1991, ISA.

[26]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[27]  Katta G. Murty,et al.  Mathematical programming: State of the art 1994 , 1994 .

[28]  Clyde L. Monma,et al.  On the Structure of Minimum-Weight k-Connected Spanning Networks , 1990, SIAM J. Discret. Math..

[29]  Tibor Jordán,et al.  A Note on the Vertex-Connectivity Augmentation Problem , 1997, J. Comb. Theory, Ser. B.

[30]  V. Rich.  Personal communication , 1989, Nature.

[31]  Tsan-sheng Hsu,et al.  A linear time algorithm for triconnectivity augmentation , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.