Skip to main content
SpringerLink
Log in

Maximal dynamic flow

  • 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. Yu. M. Ermol'ev and I. M. Mel'nik, Extremal Problems on Graphs, Naukova Dumka, Kiev (1968).

    Google Scholar 

  2. L. Ford and D. Folkerson, Flows in Networks [Russian translation], Mir, Moscow (1966).

    Google Scholar 

  3. I. M. Mel'nik, “Maximal dynamic flow in a network,” Symp. Mathematical Research Methods and System Optimization, IK Akad. Nauk UkrSSR, Kiev (1971).

Download references

Authors
  1. I. M. Mel'nik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 99–102, January–February, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mel'nik, I.M. Maximal dynamic flow. Cybern Syst Anal 9, 117–121 (1973). https://doi.org/10.1007/BF01068674

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation