Small cuts and connectivity certificates: A fault tolerant approach

We revisit classical connectivity problems in the CONGEST model of distributed computing. By using techniques from fault tolerant network design, we show improved constructions, some of which are even “local” (i.e., with O^e(1) rounds) for problems that are closely related to hard global problems (i.e., with a lower bound of Ω(Diam + √n) rounds). Distributed Minimum Cut: Nanongkai and Su presented a randomized algorithm for computing a (1 + ϵ)-approximation of the minimum cut using O^e(D + √n) rounds where D is the diameter of the graph. For a sufficiently large minimum cut λ = Ω(√n), this is tight due to Das Sarma et al. [FOCS’11], Ghaffari and Kuhn [DISC’13]. ⁃ Small Cuts: A special setting that remains open is where the graph connectivity λ is small (i.e., constant). The only lower bound for this case is Ω(D), with a matching bound known only for λ ≤ 2 due to Pritchard and Thurimella [TALG’11]. Recently, Daga, Henzinger, Nanongkai and Saranurak [STOC’19] raised the open problem of computing the minimum cut in poly(D) rounds for any λ = O(1). In this paper, we resolve this problem by presenting a surprisingly simple algorithm, that takes a completely different approach than the existing algorithms. Our algorithm has also the benefit that it computes all minimum cuts in the graph, and naturally extends to vertex cuts as well. At the heart of the algorithm is a graph sampling approach usually used in the context of fault tolerant (FT) design. ⁃ Deterministic Algorithms: While the existing distributed minimum cut algorithms are randomized, our algorithm can be made deterministic within the same round complexity. To obtain this, we introduce a novel definition of universal sets along with their efficient computation. This allows us to derandomize the FT graph sampling technique, which might be of independent interest. ⁃ Computation of all Edge Connectivities: We also consider the more general task of computing the edge connectivity of all the edges in the graph. In the output format, it is required that the endpoints u, v of every edge (u, v) learn the cardinality of the u-v cut in the graph. We provide the first sublinear algorithm for this problem for the case of constant connectivity values. Specifically, by using the recent notion of low-congestion cycle cover, combined with the sampling technique, we compute all edge connectivities in poly(D) · 2^O(√log n log log n⁾ rounds. Sparse Certificates: For an n-vertex graph G and an integer λ, a λ-sparse certificate H is a subgraph H ⊆ G with O(λn) edges which is λ-connected iff G is λ-connected. For D-diameter graphs, constructions of sparse certificates for λ ∈ {2, 3} have been provided by Thurimella [J. Alg.’97] and Dori [PODC’18] respectively using O^e(D) number of rounds. The problem of devising such certificates with o(D + √n) rounds was left open by Dori [PODC’18] for any λ ≥ 4. Using connections to fault tolerant spanners, we considerably improve the round complexity for any λ ∈ [1, n] and ϵ ∈ (0, 1), by showing a construction of (1−ϵ)λ-sparse certificates with O(λn) edges using only O(1/ϵ²·log²⁺o⁽¹⁾ n) rounds.