[AS-93]
R.J. Anderson and J.C. Setubal.
"Goldberg's Algorithm for the Maximum Flow in Perspective: a Computational Study".
In D.S. Johnson and C.C. McGeoch, editors, Network Flows and Matching: First DIMACS Implementation Challenge, pages 1--18. AMS, 1993.


[AC-97]
D.L. Applegate and W.J. Cook.
Personal communication.
Rice University, 1997.


[CGKLS-97]
C.S. Chekuri, A.V. Goldberg D.R. Karger, M.S. Levine, and C.Stein.
"Experimental Study of Minimum Cut Algorithms".
In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, pages 324--333, 1997.


[CG-97]
B.V. Cherkassky and A.V. Goldberg.
"On Implementing Push-Relabel Method for the Maximum Flow Problem".
Algorithmica, 19:390--410, 1997.


[DM-89]
U.Derigs and W.Meier.
"Implementing Goldberg's Max-Flow Algorithm --- A Computational Investigation".
ZOR --- Methods and Models of Operations Research, 33:383--403, 1989.


[FF-62]
L.R. Ford, Jr. and D.R. Fulkerson.
"Flows in Networks".
Princeton Univ. Press, Princeton, NJ, 1962.


[gol-87]
A.V. Goldberg.
"Efficient Graph Algorithms for Sequential and Parallel Computers".
PhD thesis, M.I.T., January 1987. (Also available as Technical Report TR-374, Lab. for Computer Science, M.I.T., 1987).


[GR-98]
A.V. Goldberg and S.Rao.
"Beyond the Flow Decomposition Barrier".
J. Assoc. Comput. Mach., 45:753--782, 1998.


[GT-88-2]
A.V. Goldberg and R.E. Tarjan.
"A New Approach to the Maximum Flow Problem".
J. Assoc. Comput. Mach., 35:921--940, 1988.


[GH-61]
R.E. Gomory and T.C. Hu.
Multi-terminal network flows.
J. SIAM, 9:551--570, 1961.


[gro-97]
M.Groetschel.
Personal communication.
ZIB Berlin, 1997.


[gus-90]
D.Gusfield.
"Very Simple Methods for All Pairs Network Flow Analysis".
SIAM Journal on Computing, 19:143--155, 1990.


[HO-94]
J.Hao and J.B. Orlin.
"A Faster Algorithm for Finding the Minimum Cut in a Directed Graph".
J. Algorithms, 17:424--446, 1994.


[Hu-82]
T.C. Hu.
"Combinatorial Algorithms".
Addison-Wesley, Reading, MA, 1982.


[JRT-97]
M.Juenger, G.Rinaldi, and S.Thienel.
"Practical performance of efficient minimum cut algorithms".
In Proc.\ 1st Workshop on Algorithm Engineering, Venice, Italy, 1997. Available via URL http://www.dsi.unive.it/~wae97/proceedings/.


[lev-97]
M.S. Levine.
"Experimental Study of Minimum Cut Algorithms".
Technical Report MIT-LCS-TR-719, MIT Lab for Computer Science, 1997.


[NOI-94]
H.Nagamochi, T.Ono, and T.Ibaraki.
"Implementing an Efficient Minimum Capacity Cut Algorithm". Math. Prog., 67:297--324, 1994.


[NV-93]
Q.C. Nguyen and V.Venkateswaran.
"Implementations of Goldberg-Tarjan Maximum Flow Algorithm".
In D.S. Johnson and C.C. McGeoch, editors, "Network Flows and Matching: First DIMACS Implementation Challenge", pages 19--42. AMS, 1993.


[PR-90]
M.Padberg and G.Rinaldi.
"An Efficient Algorithm for the Minimum Capacity Cut Problem".
Math. Prog., 47:19--36, 1990.

Last Updated: Fri Nov 19 14:58:27 EST 1999
Back to the main page.