Mechthild Stoer
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.
- AHUJA, R. K., ORLIN, J. B., AND TARJAN, R.E. 1989. Improved time bounds for the maximum flow problem. SIAM J. Comput. 18, 939-954. Google Scholar
- ALON, N. 1990. Generating pseudo-random permutations and maximum flow algorithms. Inf. Proc. Lett. 35, 201-204. Google Scholar
- CHERIYAN, J., HAGERUP, T., AND MEHLHORN, K. 1990. Can a maximum flow be computed in o(nm) time? In Proceedings of the 17th International Colloquium on Automata, Languages and Programming. pp. 235-248. Google Scholar
- FORD, L. R., AND FULKERSON, D. R. 1956. Maximal flow through a network. Can. J. Math. 8, 399-404.Google Scholar
- FRANK, A. 1994. On the Edge-Connectivity Algorithm of Nagamochi and Ibaraki. Laboratoire Artemis, IMAG, Universit6 J. Fourier, Grenoble, Switzerland.Google Scholar
- FREDMAN, M. L., AND TARJAN, R.E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 3 (July), 596-615. Google Scholar
- GOLDBERG, A. V., AND TARJAN, R.E. 1988. A new approach to the maximum-flow problem. J. ACM 35, 4 (Oct.), 921-940. Google Scholar
- HAO, J., AND ORLIN, J.B. 1992. A faster algorithm for finding the minimum cut in a graph. In Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms (Orlando, Fla., Jan. 27-29). ACM, New York, pp. 165-174. Google Scholar
- KARGER, D., AND STEIN, C. 1993. An 0(n2) algorithm for minimum cuts. In Proceedings of the 25th ACM Symposium on the Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 757-765. Google Scholar
- MATULA, D. W. 1993. A linear time 2 + e approximation algorithm for edge connectivity. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Mathematics ACM, New York, pp. 500-504. Google Scholar
- MEHLHORN, K., AND NXHER, S. 1995. LEDA: a platform for combinatorial and geometric computing. Commun. ACM 38, 96-102. Google Scholar
- NAGAMOCHI, U., AND IBARAKI, T. 1992a. Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583-596.Google Scholar
- NAGAMOCHI, U., AND IBARAKI, T. 1992b. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Disc. Math. 5, 54-66. Google Scholar
- NISHIZEKI, T., AND POLJAK, S. 1989. Highly connected factors with a small number of edges. Preprint.Google Scholar
- aQUEYRANNE, M. 1995. A combinatorial algorithm for minimizing symmetric submodular functions. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Mathematics ACM, New York, pp. 98-101. Google Scholar
Index Terms
- A simple min-cut algorithm
Recommendations
Revisiting a simple algorithm for the planar multiterminal cut problem
Yeh (2001) [W.-C. Yeh, A simple algorithm for the planar multiway cut problem, J. Algorithms 39 (2001) 68-77] described a simple algorithm with time complexity O((k-32)^k^-^1(n-k)^2^k^-^4(nk-32k^2+12k)log(n-k)) for the planar minimum k-terminal cut ...
On the cut polytope
The cut polytopePC(G) of a graphG=(V, E) is the convex hull of the incidence vectors of all edge sets of cuts ofG. We show some classes of facet-defining inequalities ofPC(G). We describe three methods with which new facet-defining inequalities ofPC(G) ...
A Polynomial Algorithm for the k-cut Problem for Fixed k
The k -cut problem is to find a partition of an edge weighted graph into k nonempty components, such that the total edge weight between components is minimum. This problem is NP-complete for an arbitrary k and its version involving fixing a vertex ...
Comments