Affiliation:
1. Televerkets Forskningsinstitutt, Kjeller, Norway
2. Freie Univ. Berlin, Berlin-Dahlem, Germany
Abstract
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
.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference15 articles.
1. Improved Time Bounds for the Maximum Flow Problem
2. Generating pseudo-random permutations and maximum flow algorithms
3. Can a maximum flow be computed in o(nm) time?
4. Maximal flow through a network;FORD L. R.;Can. J. Math.,1956
5. FRANK A. 1994. On the Edge-Connectivity Algorithm of Nagamochi and Ibaraki. Laboratoire Artemis IMAG Universit6 J. Fourier Grenoble Switzerland. FRANK A. 1994. On the Edge-Connectivity Algorithm of Nagamochi and Ibaraki. Laboratoire Artemis IMAG Universit6 J. Fourier Grenoble Switzerland.
Cited by
431 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献