Skip to main content
SpringerLink
Log in

Minimal realization of an assigned graph

  • 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. L. Mitten and G. Nemhauser, “Multistage optimization,” Chem. Eng. Prog., 59 (1963).

  2. R. Aris, Discrete Dynamic Programming [Russian translation], Mir, Moscow (1969).

    Google Scholar 

  3. A. A. Korbut and Yu. B. Finkel'shtein, Discrete Programming [in Russian], Nauka, Moscow (1969).

    Google Scholar 

Download references

Authors
  1. L. S. Presman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 104–107, March–April, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Presman, L.S. Minimal realization of an assigned graph. Cybern Syst Anal 7, 327–331 (1971). https://doi.org/10.1007/BF01071807

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation