A simple min-cut algorithm

We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm known. The runtime analysis is straightforward. In contrast to nearly all approaches so far, the algorithm uses no flow techniques. Roughly speaking, the algorithm consists of about |V| nearly identical phases each of which is a maximum adjacency search.

[1]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[2]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[3]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[4]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[5]  Maurice Queyranne,et al.  A combinatorial algorithm for minimizing symmetric submodular functions , 1995, SODA '95.

[6]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[7]  D. Matula.  A linear time 2 + &&egr;ε approximation algorithm for edge connectivity , 1993, SODA '93.

[8]  Noga Alon,et al.  Generating Pseudo-Random Permutations and Maximum Flow Algorithms , 1990, Inf. Process. Lett..

[9]  Kurt Mehlhorn,et al.  Can A Maximum Flow be Computed on o(nm) Time? , 1990, ICALP.

[10]  David R. Karger,et al.  An Õ(n2) algorithm for minimum cuts , 1993, STOC.

[11]  D. Matula.  A linear time 2 + ε approximation algorithm for edge connectivity , 1993, SODA 1993.

[12]  Mike Paterson,et al.  Proceedings of the 17th International Colloquium on Automata, Languages and Programming , 1990 .

[13]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[14]  Robert E. Tarjan,et al.  Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem , 2008 .

[15]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[16]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[17]  James B. Orlin,et al.  A faster algorithm for finding the minimum cut in a graph , 1992, SODA '92.