1. Computations of maximum flow in networks;Fulkerson;Nav. Res. Log.,1955
2. On the max-flow min-cut theorem of networks;Dantzig,1956
3. Algorithm for solution of a problem of maximum flow in networks with power estimation;Dinic;Sov. Math. Dokl.,1970
4. Theoretical improvements in algorithmic efficiency for network flow problems;Edmonds;J. ACM,1972
5. Determining the maximal flow in a network by the method of preflows;Karzanov;Sov. Math. Dokl.,1974