1. Ford, L.R., Jr. and Fulkerson, D.R., Flows in Networks, Princeton: Princeton Univ. Press, 1962. Translated under the title Potoki v setyakh, Moscow: Mir, 1966.
2. Ahuja, R.K., Magnati, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms and Applications, New Jersey: Prentice Hall, 1993.
3. Fleischer, L. and Skutella, M., Minimum Cost Flows Over Time without Intermediate Storage, in Proc. 35th ACM/SIAM Symp. on Discrete Algorithms (SODA), January 2003, pp. 66–75.
4. Szeto, W., Iraqi, Y., and Boutaba, R., A Multi-Commodity Flow Based Approach to Virtual Network Resource Allocation, Global Telecommun. Conf. 2003 (GLOBECOM’ 03), IEEE, 2003.
5. Zhilyakova, L.Yu., Implementing Recursive Queries in a Dynamic Associative Resource Network, in Proc. 12th National Conference on Artificial Intelligence with International Participation (KII’2010), Moscow: Fizmatlit, 2010, vol. 1, pp. 335–343.