Referências

1

R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.

2

G.B. Dantzig, Application of the simplex method to a transportation problem, Activity Analysis of Production and Allocation (Tj.C. Koopmans, ed.), Wiley, New York, 1951, pp. 359-373.

3

E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik (1959), 269-271.

4

E.A. Dinits, Algorithm for solution of a problem of maximum flow in a network with power esrimation, Soviet Mathematics Doklady (1970), no. 11, 1277-1280.

5

J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the Association for Computing Machinery 19 (1972), 248-264.

6

P. Elias, A. Feinstein, and C.E. Shannon, A note on the maximum flow through a network, IRE Transactions on Information Theory 2 (1956), 117-119.

7

L.R. Ford Jr. and D.R. Fulkerson, Maximal flow through a network, Canadian Journal of Mathematics 8 (1956), 399-404.

8

A.V. Karzanov, Determining the maximal flow in a network by the method of preflows, Soviet Mathematics Doklady (1974), 434-437.

9

E. Lawler, Combinatorial optimization: Networks and matroids, New Yor, Holt, Rinehart and Winston, 1976.

10

C.H. Papadrimitriou and K. Steigliz, Combinatorial optimization: Algorithms and complexity, Prentice-Hall, Englewood Cliffs, New Jersey,, 1982.

11

M. Queyranne, Theoretical efficiency of the algorithm ``capacity'' for the maximum flow problem, Mathematics of Operations Research 5 (1980), 258-266.

12

A. Schrijver, Paths and flows--a historical surve, CWI Quarterly (1993).

13

D.D. Sleator and R.E. Tarjan, A data structure for dynamic trees, Journal of Computer and System Sciences 24 (1983), 362-391.

14

R.E. Tarjan, Data structures and network algorithms, SIAM, Philadelphia, PA, 1983.