New Distance-Directed Algorithms for Maximum Flow and Parametric Maximum Flow Problems (1987)

Cached

Download Links

by James B. Orlin , Ravindra K. Ahuja
Citations:6 - 4 self

Active Bibliography

4 Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems – Ravindra K. Ahuja, James B. Orlin - 1991
39 Network Flow Algorithms – Andrew V. Goldberg, Eva Tardos, Robert E. Tarjan
524 A new approach to the maximum flow problem – Andrew V. Goldberg, Robert E. Tarjan - 1988
32 A Fast and Simple Algorithm for the Maximum Flow Problem – R. K. Ahuja, James B. Orlin - 1989
23 Recent developments in maximum flow algorithms – A Goldberg - 1998
11 Length Functions for Flow Computations – Andrew V. Goldberg, Satish Rao - 1997
116 A FASTER STRONGLY POLYNOMIAL MINIMUM COST FLOW ALGORITHM – James B. Orlin - 1991
130 Faster scaling algorithms for network problems – Harold N. Gabow, Robert E. Tarjan - 1989
832 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision – Yuri Boykov, Vladimir Kolmogorov - 2001