1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
2. L. R. Ford, Jr., and D. R. Fulkerson, Canad. J. Math 8, 399–404 (1956).
3. M. Stoer and F. Wagner, in Algorithms—ESA’94 (Springer-Verlag, Berlin, 1994), pp. 141–147.
4. M. M. Deza and M. Laurent, Geometry of Cuts and Metrics (Algorithms and Combinatorics), 2nd ed. (Springer-Verlag, Berlin, 2009).
5. V. A. Bondarenko and A. N. Maksimenko, Geometric Constructions and Complexity in Combinatorial Optimization (LKI, Moscow, 2008) [in Russian].