Skip to main content
SpringerLink
Log in

Algorithms for solving for the minimal flow in a network

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  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. L. R. Ford and D. R. Fulkerson, Flows in Networks [Russian translation], Mir, Moscow (1962), pp. 33–35.

    Google Scholar 

Download references

Authors
  1. Yu V. Voitishin
    View author publications

    You can also search for this author in PubMed Google Scholar

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). https://doi.org/10.1007/BF01099374

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01099374

Keywords

Search

Navigation