|
32
|
Network Flow Algorithms
– Andrew V. Goldberg, Eva Tardos, Robert E. Tarjan
|
|
17
|
Recent Developments in Maximum Flow Algorithms
– Andrew V. Goldberg
- 1998
|
|
10
|
Length Functions for Flow Computations
– Andrew V. Goldberg, Satish Rao
- 1997
|
|
5
|
New Distance-Directed Algorithms for Maximum Flow and Parametric Maximum Flow Problems
– James B. Orlin, Ravindra K. Ahuja
- 1987
|
|
26
|
DUAL COORDINATE STEP METHODS FOR LINEAR NETWORK FLOW PROBLEMS
– Dimitri P. Bertsekas, Jonathan Eckstein
- 1988
|
|
119
|
On implementing the push-relabel method for the maximum flow problem
– Boris V. Cherkassky, Andrew V. Goldberg
- 1994
|
|
391
|
A new approach to the maximum flow problem
– Andrew V. Goldberg, Robert E. Tarjan
- 1988
|
|
28
|
Improved Algorithms For Bipartite Network Flow
– Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert E. Tarjan
- 1994
|
|
|
Max flows in O(nm) time, or better
– James B. Orlin
- 2012
|
|
34
|
Improved Time Bounds for the Maximum Flow Problem
– Ravindra K. Ahuja, James B. Orlin, Robert E. Tarjan
- 1988
|
|
1
|
The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
– Andrew V. Goldberg
|
|
96
|
A FASTER STRONGLY POLYNOMIAL MINIMUM COST FLOW ALGORITHM
– James B. Orlin
- 1991
|
|
33
|
Sublinear-Time Parallel Algorithms for Matching and Related Problems
– Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
- 1988
|
|
9
|
A PRIMAL SIMPLEX ALGORITHM THAT SOLVES THE MAXIMUM FLOW PROBLEM IN AT MOST nm PIVOTS AND O(n²m) TIME
– Donald Goldfarb, Jianxiu Hao
- 1990
|
|
23
|
Finding Minimum-Cost Flows by Double Scaling
– Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert E. Tarjan
- 1992
|
|
|
Solving Maximum Flow Problems on Real World Bipartite Graphs
– Cosmin Silvestru, Barbara Stanley, Clifford Stein, Cristian George Strat
|
|
|
Solving Maximum Flow Problems on Real World Bipartite Graphs
– Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat
|
|
5
|
Quantum algorithms for matching and network flow
– Andris Ambainis, Robert Spalek
- 2006
|
|
16
|
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
– Andrew V. Goldberg, Michael D. Grigoriadis, Robert E. Tarjan
- 1991
|
