Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Algorithms for solving for the minimal flow in a network

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

    C. Berge, The Theory of Graphs and Its Applications [Russian translation], IL, Moscow (1962), pp. 88–89.

  2. 2.

    A. Coffman, Introduction to Applied Combinatorics [Russian translation], Nauka, Moscow (1975), pp. 370–371.

  3. 3.

    G. N. Adel'son-Vel'skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975), pp. 25–41.

  4. 4.

    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.

  5. 5.

    L. R. Ford and D. R. Fulkerson, Flows in Networks [Russian translation], Mir, Moscow (1962), pp. 33–35.

Download references

Additional information

Translated from Kibernetika, No. 1, pp. 116–118, January–February, 1980.

Rights and permissions

Reprints and Permissions

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).

Download citation


  • Operating System
  • Artificial Intelligence
  • System Theory
  • Minimal Flow