Skip to main content
SpringerLink
Log in

Problem of parallel ordering on graphs with the structure of parallel-serial networks

  • 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. V. E. Kotov, “Theory of parallel programming,” Kibernetika, No. 1 (1974).

  2. V. V. Shkurba, “On ordering problems,” Kibernetika, No. 2 (1967).

  3. F. Harary, “Combinatory problems in graph enumeration,” in: Applied Combinational Mathematics [in Russian], Moscow (1968).

  4. K. V. Shakhbazyan and T. A. Tushkina, “Parallel ordering of several processes,” Kibernetika, No. 5 (1971).

  5. T. A. Tushkina and K. V. Shakhbazyan, “Solution of several problems of parallel ordering,” in Proceedings of the Leningrad Branch of the V. A. Steklov Scientific Seminars Institute of Mathematics [in Russian], Vol. 18, Leningrad (1970).

Download references

Authors
  1. K. V. Shakhvazyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. A. Tushkina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. B. Levedinskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 81–85, September–October, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shakhvazyan, K.V., Tushkina, T.A. & Levedinskaya, N.B. Problem of parallel ordering on graphs with the structure of parallel-serial networks. Cybern Syst Anal 11, 755–760 (1975). https://doi.org/10.1007/BF01071367

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation