1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms and applications. Englewoord Cliffs, NJ: Prentice-Hall.
2. Berge, C. (1962). The theory of graphs and its applications. London: Methuen.
3. Chandrasekaran, R. (1969). Total unimodularity of matrices. SIAM Journal on Applied Mathematics, 11, 1032–1034.
4. Christofides, N. (1975). Graph theory: An algorithmic approach. New York: Academic.
5. Dinc, E. A. (1970). Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady, 11, 1277–1280.