1. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms, and Applications, Englewood
Cliffs: Prentice Hall, 1993.
2. Lovász, L. and Plummer, M., Matching
Theory, Budapest: Akadémiai Kiadó, 1986. Translated under the
title: Prikladnye zadachi teorii grafov. Teoriya parosochetanii v
matematike, fizike, khimii, Moscow: Mir, 1998.
3. Adel’son-Vel’skii, G.M., Dinits, E.A., and Karzanov, A.V., Potokovye
algoritmy (Flow Algorithms), Moscow: Nauka, 1975.
4. Sedgewick, R., Algorithms in C++,
Boston: Addison-Wesley, 1992. Translated under the title: Fundamental’nye algoritmy na C++. Algoritmy na grafakh, St.
Petersburg: DiaSoftYuP, 2002.
5. Erusalimskii, Ya.M., Skorokhodov, V.A., Kuz’minova, M.V., and Petrosyan, A.G., Grafy s nestandartnoi dostizhimost’yu: zadachi, prilozheniya
(Graphs with Nonstandard Reachability: Problems, Applications), Rostov-on-Don: Izd. Yuzhn.
Fed. Univ., 2009.