DeepAI AI Chat
Log In Sign Up

Recursive Random Contraction Revisited

10/29/2020
by   David R. Karger, et al.
MIT
cornell university
0

In this note, we revisit the recursive random contraction algorithm of Karger and Stein for finding a minimum cut in a graph. Our revisit is occasioned by a paper of Fox, Panigrahi, and Zhang which gives an extension of the Karger-Stein algorithm to minimum cuts and minimum k-cuts in hypergraphs. When specialized to the case of graphs, the algorithm is somewhat different than the original Karger-Stein algorithm. We show that the analysis becomes particularly clean in this case: we can prove that the probability that a fixed minimum cut in an n node graph is returned by the algorithm is bounded below by 1/(2H_n-2), where H_n is the nth harmonic number. We also consider other similar variants of the algorithm, and show that no such algorithm can achieve an asymptotically better probability of finding a fixed minimum cut.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/20/2019

The Karger-Stein Algorithm is Optimal for k-cut

In the k-cut problem, we are given an edge-weighted graph and want to fi...
10/29/2021

A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs

An s-t minimum cut in a graph corresponds to a minimum weight subset of ...
10/05/2021

Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice

The minimum graph cut and minimum s-t-cut problems are important primiti...
06/02/2019

The Number of Minimum k-Cuts: Improving the Karger-Stein Bound

Given an edge-weighted graph, how many minimum k-cuts can it have? This ...
08/17/2018

LP Relaxation and Tree Packing for Minimum k-cuts

Karger used spanning tree packings to derive a near linear-time randomiz...
11/26/2019

Faster Algorithms for Parametric Global Minimum Cut Problems

The parametric global minimum cut problem concerns a graph G = (V,E) whe...
07/04/2019

Fixed-parameter tractability of counting small minimum (S,T)-cuts

The parameterized complexity of counting minimum cuts stands as a natura...