Minimum cuts in near-linear time

Journal of the ACM

Volumn 47, Issue 1, 2000, Pages 46-76

  Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Connectivity; Min cut; Monte carlo algorithm; Optimization; Tree packing

Indexed keywords

CONNECTIVITY; MIN-CUT; MONTE CARLO ALGORITHMS; TREE PACKING;

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL METHODS; DATA STRUCTURES; LINEAR PROGRAMMING; MATHEMATICAL OPERATORS; MONTE CARLO METHODS; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

COMPUTER SCIENCE;

EID: 0002472328     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/331605.331608     Document Type: Article

References (39)

1. BARAHONA, F. 1995. Packing spanning trees. Math. Oper. Res. 20, 1 (Feb.), 104-115.
2. BENCZUR, A. A. 1995. A representation of cuts within 6/5 times the edge connectivity with applications. In Proceedings of the 36th Annual Symposium on the Foundations of Computer Science, (Oct.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 92-102.
3. BERKMAN, O., AND VISHKIN, U. 1993. Recursive star-tree parallel data structure. SIAM J. Comput. 22, 2 (Apr.), 221-242.
4. BOLLOBÁS, B. 1985. Random Graphs. Harcourt Brace Janovich, San Diego, Calif.
5. BOTAFOGO, R. A. 1993. Cluster analysis for hypertext systems. In Proceedings of the 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (Pittsburgh, Pa., June 27-July 1). ACM, New York, pp. 116-125.
6. DANTZIG, G. B., FULKERSON, D. R., AND JOHNSON, S. M. 1954. Solution of a large-scale traveling salesman problem. Oper. Re. 2, 393-410.
7. DINITZ, E. A., KARZANOV, A. V., AND LOMONOSOV, M. V. 1976. On the structure of a family of minimum weighted cuts in a graph. In Studies in Discrete Optimization, A. A. Fridman, ed. Nauka Publishers, pp. 290-306.
8. EDMONDS, J. 1972. Edge-disjoint branchings. In Combinatorial Algorithms, R. Rustin, ed. Algorithmics Press, pp. 91-96.
9. FORD, L. R., JR., AND FULKERSON, D. R. 1962. Flows in Networks. Princeton University Press, Princeton, N. J.
10. GABOW, H. N. 1995. A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci. 50, 2 (Apr.), 259-273.
11. GABOW, H. N., AND TARJAN, R. E. 1985. A linear time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30, 209-221.
12. GABOW, H. N., AND WESTERMANN, H. H. 1992. Forests, frames, and games: Algorithms for matroid sums and applications. Algorithmica 7, 5, 465-497.
13. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, Calif.
14. GOLDBERG, A. V., AND TARJAN, R. E. 1988. A new approach to the maximum-flow problem. J. ACM 35, 4 (Oct.), 921-940.
15. GOMORY, R. E., AND HU, T. C. 1961. Multi-terminal network flows. J. Soc. Indust. Appl. Math. 9, 4 (Dec.), 551-570.
16. HAO, J., AND ORLIN, J. B. 1994. A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms 17, 3, 424-446.
17. HENZINGER, M. R., AND KING, V. 1999. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM, 46, 4 (July), 502-516.
18. HENZINGER, M., AND WILLIAMSON, D. P. 1996. On the number of small cuts in a graph. Inf. Proc. Lett. 59, 41-44.
19. HOLM, J., DE LICHTENBERG, K., AND THORUP, M. 1998. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. In Proceedings of the 30th ACM Symposium on Theory of Computing, (Dallas, Tex., May 23-26), ACM, New York, pp. 79-89.
20. JOHNSON, D. B., AND METAXAS, P. 1992. A parallel algorithm for computing minimum spanning trees. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, (San Diego, Calif., June 29-July 1) ACM, New York, pp. 363-372.
21. KARGER, D. R. 1993. Global min-cuts in RNC and other ramifications of a simple min-cut algorithm. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, (Austin, Tex., Jan. 25-27). ACM, New York, pp. 21-30.
22. KARGER, D. R. 1994. Random Sampling in Graph Optimization Problems. Ph.D. dissertation. Stanford University, Stanford, Calif. Contact at karger@lcs.mit.edu. Available from http://theory.les.mit.edu/~karger.
23. KARGER, D. R. 1998. Random sampling and greedy sparsification in matroid optimization problems. Math. Prog. B 82, 1-2 (June), 41-81.
24. KARGER, D. R. 1999a. Random sampling in cut, flow, and network design problems. Math. Oper. Res. 24, 2 (May), 383-413.
25. KARGER, D. R. 1999b. A randomized fully polynomial approximation scheme for the all terminal network reliability problem. SIAM J. Comput. 29, 2, 492-514.
26. KARGER, D. R., AND STEIN, C. 1996. A new approach to the minimum cut problem. J. ACM 43, 4 (July), 601-640.
27. KARP, R. M., AND RAMACHANDRAN, V. 1990. Parallel algorithms for shared memory machines. In Handbook of Theoretical Computer Science, volume A, J. van Leeuwen, ed. MIT Press, Cambridge, Mass., pp. 869-932.
28. LAWLER, E. L., LENSTRA, J. K., RINOOY KAN, A. H. G., AND SHMOYS, D. B., EDS. 1985. The Traveling Salesman Problem. Wiley, New York.
29. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, New York, N. Y.
30. NAGAMOCHI, H., AND IBARAKI, T. 1992a. Computing edge connectivity in multigraphs and capacitated graphs. SIAM J. Disc. Math. 5, 1 (Feb.), 54-66.
31. NAGAMOCHI, H., AND IBARAKI, T. 1992b. Linear time algorithms for finding k-edge connected and k-node connected spanning subgraphs. Algorithmica 7, 583-596.
32. NAGAMOCHI, H., NISHIMURA, K., AND IBARAKI, T. 1994. Computing all small cuts in an undirected network. Tech. Rep. 94007. Kyoto Univ. Kyoto, Japan.
33. NASH-WILLIAMS, C. ST. J. A. 1961. Edge disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 445-450.
34. PADBERG, M., AND RINALDI, G. 1990. An efficient algorithm for the minimum capacity cut problem. Math. Prog. 47, 19-39.
35. PICARD, J.-C., AND QUEYRANNE, M. 1982. Selected applications of minimum cuts in networks. I.N.F.O.R: Canad. J. Oper. Res. Inf. Proc. 20, (Nov.), 394-422.
36. PLOTKIN, S., SHMOYS, D., AND TARDOS, E. 1991. Fast approximation algorithms for fractional packing and covering problems. In Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science. (Oct.) IEEE Computer Society Press, Los Alamitos, Calif., pp. 495-504.
37. SCHIEBER, R., AND VISHKIN, U. 1988. On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput. 17, (Dec.), 1253-1262.
38. SLEATOR, D. D., AND TARJAN, R. E. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 3 (June), 362-391.
39. VAZIRANI, V. V., AND YANNAKAKIS, M. 1992. Suboptimal cuts: Their enumeration, weight, and number. In Automata, Languages and Programming. 19th International Colloquium Proceedings. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, New York, pp. 366-377.