Minimum Cuts in Near-Linear Time

  title={Minimum Cuts in Near-Linear Time},
  author={David R. Karger},
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a “semi-duality” between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized rdgorithm that finds a minimum cut in an medge, n-vertex graph with high probability in O (m log3 n) time. We also give a simpler randomized algorithm that finds all minimum cuts with high probability in O(n2 log n) time. This… CONTINUE READING
Highly Influential
This paper has highly influenced 34 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 257 citations. REVIEW CITATIONS


Publications citing this paper.

257 Citations

Citations per Year
Semantic Scholar estimates that this publication has 257 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…