This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
C. Berge, The Theory of Graphs and Its Applications [Russian translation], IL, Moscow (1962), pp. 88–89.
A. Coffman, Introduction to Applied Combinatorics [Russian translation], Nauka, Moscow (1975), pp. 370–371.
G. N. Adel'son-Vel'skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975), pp. 25–41.
L. E. Kornilova, “The minimal flow and maximal rate of change in a network,” in: Mathematical Methods in Economics Research and Planning [in Russian], No. 1, Inst. Kibern. Akad. Nauk UkrSSR (1967), pp. 35–45.
L. R. Ford and D. R. Fulkerson, Flows in Networks [Russian translation], Mir, Moscow (1962), pp. 33–35.
Translated from Kibernetika, No. 1, pp. 116–118, January–February, 1980.
About this article
Cite this article
Voitishin, Y.V. Algorithms for solving for the minimal flow in a network. Cybern Syst Anal 16, 131–134 (1980). https://doi.org/10.1007/BF01099374
- Operating System
- Artificial Intelligence
- System Theory
- Minimal Flow