130

Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation
– E A Dinic
 1970

65

A strongly polynomial minimum cost circulation algorithm
– Éva Tardos
 1985

27

A distributed algorithm for the assignment problem,” working paper, Lab. for Information and Decision Systems
– D P Bertsekas

455

Combinatorial optimization: networks and matroid
– E Lawler
 1976

94

R.E.Tarjan, "Network flow and testing graph connectivity
– S Even
 1976

549

An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs
– J E Hopcroft, R M Karp
 1973

67

Solving Minimum Cost Flow Problem by Successive Approximation
– A V Goldberg, R E Tarjan
 1987

44

Efficient graph algorithms for sequential and parallel computers
– A V Goldberg
 1987

86

Algorithm 360: Shortest path forest with topological ordering
– R Dial
 1969

29

DUAL COORDINATE STEP METHODS FOR LINEAR NETWORK FLOW PROBLEMS
– Dimitri P. Bertsekas, Jonathan Eckstein
 1988

66

Finding minimumcost circulations by canceling negative cycles
– V Goldberg, R E Tarjan
 1989

48

Finding MinimumCost Circulations by Successive Approximation
– A V Goldberg, R E Tarjan
 1990

29

Distributed asynchronous relaxation methods for linear network flow problems
– D P Bertsekas, J Eckstein

305

A Data Structure for Dynamic Trees
– D D Sleator, R E Tarjan
 1983

59

Scaling Algorithms for Network Problems
– Harold N. Gabow
 1985

23

V.: A New MaxFlow Algorithm
– A Goldberg
 1985

512

A new approach to the maximum flow problem
– Andrew V. Goldberg, Robert E. Tarjan
 1988

8

Fibonacci heaps and their uses in network optimization algorithms
– Tarjan
 1984

8

Routing and scheduling of vehicles and crews
– L D Bodin, B L Golden, A A Assad, M O Ball
 1983
