Skip to main content
SpringerLink
Log in

Minimizing the channel width for a linear arrangement of elements of discrete systems

  • 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, Graphes et hypergraphes, Dunod, Paris (1970).

    Google Scholar 

  2. L. S. Bershtein and V. V. Selyankin, “Linear arrangement of hypergraphs,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 3, 128–135 (1976).

    Google Scholar 

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

    Google Scholar 

Download references

Authors
  1. L. S. Bershtein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Rabinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 71–75, 85, May–June, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bershtein, L.S., Rabinovich, V.A. Minimizing the channel width for a linear arrangement of elements of discrete systems. Cybern Syst Anal 16, 383–388 (1980). https://doi.org/10.1007/BF01078257

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation