R. Ahuja, T. Magnanti, and J. Orlin, Network Flows. Theory, algorithms and applications, 1993.

R. Ahuja, J. Orlin, C. Stein, and R. Tarjan, Improved Algorithms for Bipartite Network Flow, SIAM Journal on Computing, vol.23, issue.5, pp.23-906, 1994.
DOI : 10.1137/S0097539791199334

E. Ciurea, An algorithm for minimal dynamic flow, Korean Journal of Computational and Applied Mathematics, vol.7, issue.2, pp.259-270, 2000.

E. Ciurea and L. Ciupal?-a, Sequential and parallel algorithms for minimum flows, Journal of Applied Mathematics and Computing, vol.3, issue.1-2, pp.53-75, 2004.
DOI : 10.1007/BF02935746

E. Ciurea, O. Georgescu, and D. Marinescu, Improved algorithms for minimum flows in bipartite networks, International Journal of Computers, vol.2, issue.4, pp.351-360, 2008.

D. Gusfield, C. Martel, and D. Fernandez-baca, Fast Algorithms for Bipartite Network Flow, SIAM Journal on Computing, vol.16, issue.2, pp.237-251, 1987.
DOI : 10.1137/0216020

H. F. Salehi, S. Khadayifar, and M. A. Raayatpanoh, Minimum flow problem on network flows with time-varying bounds, Applied Mathematical Modelling, vol.36, issue.9, pp.4414-4421, 2012.
DOI : 10.1016/j.apm.2011.11.067

M. Skutella, An Introduction to Network Flows Over Time, Research Trends in Combinatorial Optimization, pp.451-482, 2009.

W. Wilkinson, An Algorithm for Universal Maximal Dynamic Flows in a Network, Operations Research, vol.19, issue.7, pp.1602-1612, 1971.
DOI : 10.1287/opre.19.7.1602