A simple min-cut algorithm

Journal of the ACM

Volumn 44, Issue 4, 1997, Pages 585-591

  Stoer, Mechthild ^a   Wagner, Frank ^b  

^a Televerkets Forskningsinstitutt   (Norway)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Algorithms; Min Cut

Indexed keywords

ALGORITHMS; THEOREM PROVING;

MAXIMUM ADJACENCY SEARCH; MIN CUT ALGORITHMS;

GRAPH THEORY;

EID: 0031176702     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/263867.263872     Document Type: Article

References (15)

1. 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.
2. ALON, N. 1990. Generating pseudo-random permutations and maximum flow algorithms. Inf. Proc. Lett. 35, 201-204.
3. 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.
4. FORD, L. R., AND FULKERSON, D. R. 1956. Maximal flow through a network. Can. J. Math. 8, 399-404.
5. FRANK, A. 1994. On the Edge-Connectivity Algorithm of Nagamochi and Ibaraki. Laboratoire Artemis, IMAG, Université J. Fourier, Grenoble, Switzerland.
6. 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.
7. GOLDBERG, A. V., AND TARJAN, R. E. 1988. A new approach to the maximum-flow problem. J. ACM 35, 4 (Oct.), 921-940.
8. 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.
9. 2) 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.
10. 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.
11. MEHLHORN, K., AND NÄHER, S. 1995. LEDA: a platform for combinatorial and geometric computing. Commun. ACM 38, 96-102.
12. NAGAMOCHI, H., AND IBARAKI, T. 1992a. Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583-596.
13. NAGAMOCHI, H., AND IBARAKI, T. 1992b. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Disc. Math. 5, 54-66.
14. NISHIZEKI, T., AND POLJAK, S. 1989. Highly connected factors with a small number of edges. Preprint.
15. QUEYRANNE, 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.