A faster algorithm for finding the minimum cut in a graph

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 165-174

  Hao, Jianxiu ^a   Orlin, James B ^b  

^a VERIZON   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ARC-CONNECTIVITY; MAXIMUM FLOW PROBLEMS; MAXIMUM-FLOW ALGORITHM; NETWORK OPTIMIZATION PROBLEM; NETWORK RELIABILITY; RUNNING TIME; SOURCE NODES; UNDIRECTED NETWORK;

OPTIMIZATION;

EID: 85025245357     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Ahuja, R. Kv T. L. Magnanti, and J. B. Orlin. 1992. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, N. J.
2. Ahuja, R. K., J. B. Orlin, C. Stein, and R. E. Tarjan. 1990. Improved Algorithms for Bipartite Network Flows. Accepted for publication by Mathematical Programming.
3. Cheriyan, J. and S. N. Maheshwari. 1987. Analysis of Preflow Push Algorithms for Maximum Network Flow. Technical report, Department of Computer Science and Engineering, Indian Institute of Technology, New Delhi, India.
4. Derigs, U., and W. Meier. 1988. Implementing Goldberg's Max-How Algorithm: A Computational Investigation. Technical Report, University of Bayreuth, West Germany.
5. Ford, L.R., Jr., and D. R. Fulkerson. 1956. Maximal Flow Through a Network. Canadian Journal Math. 8, 399-404.
6. Gallo, G., M. D. Grigorladis, and R. E. Tarjan. 1989. A Fast Parametric Flow Algorithm. SIAM Journal of Computing, 18, 30-55.
7. Goldberg, A.V., and R.E. Tarjan. 1988. A New Approach to the Maximum Flow Problem. Journal of the ACM 35, 921-940.
8. King V, S. Rao, and R. E. Tarjan. 1991. A Faster Deterministic Max-flow Algorithm. Manuscript in preparation.
9. Matula, D. W. 1987. Determining Edge Connectivity in O(nm). Proceedings of the 28th Annual Symposium on Foundations of Computer Science. 249-251.
10. Mansour, Y and B. Schieber. 1988. Finding the Edge Connectivity of Directed Graphs. Research Report RC 13556, IBM Research Division, T. J. Watson Research Center, Yorktown Heights, N.Y.
11. Padberg, M. and G. Rinaldi. 1990. An efficient algorithm for the minimum capacity cut problem. Math. Programming 47, 19-36.
12. Picard, J. C. and M. Queyranne. 1982. Selected applications of minimumcuts in networks. INFOR 20, 394-422.