Efficient algorithms for computing all low s-t edge connectivities and related problems

ABSTRACT

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk³) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V₁, V₂,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε V_i and t ε V_j, for i ≠ j, is equal to the weight of the lightest edge on the path between V_i and V_j in T. Also, two vertices s and t belong to the same V_i for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n^5/2kmin{k^1/2, n^1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n^5/6).

Our algorithm yields the useful corollary that in Õ(m + nc³) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk³) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

References

References are not available

• Mathematics of computing

  • Discrete mathematics

    • Graph theory

• Theory of computation