Skip to main content
SpringerLink
Log in

Optimal subgraphs in a weighted digraph

  • 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. A. A. Zykov, Theory of Finite Graphs [in Russian], Nauka Novosibirsk (1978).

    Google Scholar 

  2. F. Harary, Graph Theory, Addison-Wesley, Reading, Massachusetts (1969).

    Google Scholar 

  3. J. Edmonds, “Optimum branchings,” J. Res. Natl. Bur. Stand., Sec. B: Math. Math. Phys.,71, No. 4, 233–240 (1967).

    Google Scholar 

  4. D. R. Fulkerson, “Packing rooted directed cuts in a weighted directed graph,” Math. Program.,6, No. 1, 1–13 (1974).

    Google Scholar 

  5. I. V. Romanovskii, Algorithms for the Solution of Extremal Problems [in Russian], Nauka, Moscow (1977).

    Google Scholar 

Download references

Authors
  1. D. D. Lozovanu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 16–19, March–April, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lozovanu, D.D. Optimal subgraphs in a weighted digraph. Cybern Syst Anal 17, 172–176 (1981). https://doi.org/10.1007/BF01069629

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation