Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting

S. Shine; K. Murali Krishnan

Home/Archive/arXiv

arXiv · 0912.1200

Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting

S. Shine·K. Murali Krishnan

View original source ↗Read source document ↗Export metadata ↓

Abstract

A min-cut that seperates vertices s and t in a network is an edge set of minimum weight whose removal will disconnect s and t. This problem is the dual of the well known s-t max-flow problem. Several algorithms for the min-cut problem are based on max-flow computation although the fastest known min-cut algorithms are not flow based. The well known Karger's randomized algorithm for min-cut is a non-flow based method for solving the (global) min-cut problem of finding the min s-t cut over all pair of vertices s,t in a weighted undirected graph. This paper presents an adaptation of Karger's algorithm for a synchronous distributed setting where each node is allowed to perform only local computations. The paper essentially addresses the technicalities involved in circumventing the limitations imposed by a distributed setting to the working of Karger's algorithm. While the correctness proof follows directly from Karger's algorithm, the complexity analysis differs significantly. The algorithm achieves the same probability of success as the original algorithm with O(mn^{2}) message complexity and O(n^{2}) time complexity, where n and m denote the number of vertices and edges in the graph.

Explore related subjects

cs.DS cs.DC

Keep this discovery

BibTeX RIS

S. Shine, K. Murali Krishnan. 2010-01-01. Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting. https://arxiv.org/abs/0912.1200

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗