1. G. M. Adel'son-Velskii, E. A. Dinic, and A. V. Karzanov.Flow Algorithms. Science, Moscow, 1975. In Russian.
2. C. Berge and A. Ghouila-Houri.Programming, Games and Transportation Networks. Wiley, New York, 1965.
3. P. J. Carstensen. The Complexity of Some Problems in Parametric, Linear, and Combinatorial Programming. Ph.D. thesis, Department of Mathematics, University of Michigan, Ann Arbor, MI, 1983.
4. E. Cohen. Combinatorial Algorithms for Optimization Problems. Ph.D. thesis, Department of Computer Science, Stanford University, Stanford, CA, 1991.
5. E. Cohen and N. Megiddo. Strongly polynomial and NC algorithms for detecting cycles in dynamic graphs.Proc. 21st Annual ACM Symposium on Theory of Computing, pp. 523?534. ACM, New York, 1989.