Approximating s-t minimum cuts in Õ(n2) time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 47-55

  Benczur, Andrés A ^a   Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FLOW GRAPHS; ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

LINEAR-TIME; MAXIMUM-FLOW ALGORITHM; MINIMUM CUT; RANDOM SAMPLING; SPARSEST CUT;

GRAPH THEORY; COMPUTATIONAL COMPLEXITY;

CORROLLARIES; LEMMA; LINEARTIME CONSTRUCTION; MINIMUM CUTS; TIME MAXIMUM FLOW ALGORITHM;

EID: 0029701736     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237827     Document Type: Conference Paper

References (14)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. H. Chernoff. A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-509, 1952.
3. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
4. Brandon Dixon, Monika Rauch, and Robert E. Tarjan. Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM Journal on Computing, 21(6):1184-1192, 1992.
5. Lester R. Ford, Jr. and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956.
6. Harold N. Gabow. A matroid approach to finding edge connectivity and packing arborescences. Journal of Computer and System Sciences, 50(2):259-273, April 1995. A preliminary version appeared in STOC 1991.
7. Andrew V. Goldberg and Robert E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35:921-940, 1988.
8. th ACM Symposium on Theory of Computing, pages 648-657. ACM, ACM Press, May 1994.
9. Submitted to Mathematics of Operations Research.
10. th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 424-432. ACM-SIAM, January 1994. Arlington, VA.
11. th ACM Symposium on Theory of Computing. ACM, ACM Press, May 1996. Philadelphia, PA.
12. nd ACM Symposium on Theory of Computing, pages 310-321. ACM, ACM Press, May 1990.
13. Hiroshi Nagamochi and Toshihide Ibaraki. Computing edge connectivity in multigraphs and capacitated graphs. SIAM Journal of Discrete Mathematics, 5(1):54-66, February 1992.
14. Hiroshi Nagamochi and Toshihide Ibaraki. Linear time algorithms for finding k-edge connected and k-node connected spanning subgraphs. Algorithmica, 7:583-596, 1992.