Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Chekuri, C., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental study of minimum cut algorithms. In: Symposium on Discrete Algorithms, pp. 324–333 (1997)
2. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)
3. Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci. 50(2), 259–273 (1995)
4. Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. SIAM 9, 551–570 (1961)
5. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35, 921–940 (1988)