Skip to main content
SpringerLink
Log in

The optimal ordering of nodes of an oriented tree

  • 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, The Theory of Finite Graphs [in Russian], Novosibirsk (1969).

  2. F. Ya. Vetukhnovskii, “The problem of coverings of a graph by a system of neighborhoods of its nodes,” Problemy Kibernetiki, No. 19, Moscow (1967).

  3. A. P. Ershov, “The programming of arithmetic expressions,” Dokl. Akad. Nauk SSSR,118, No. 3, 427–430, Moscow (1958).

    Google Scholar 

  4. R. Redziejowski, “On arithmetic expressions and trees,” Comm. ACM,12, No. 2, 81–84 (1969).

    Google Scholar 

  5. V. Chvátal, “A remark on a problem of Harary,” Czechoslovak. Math. J.,20, No. 1, 109–111 (1970).

    Google Scholar 

  6. M. A. Sheidvasser, “An optimal enumeration of the nodes of a trees,” Diskretnyi Analiz, No. 17 (1970).

Download references

Authors
  1. M. A. Sheidvasser
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 134–139, May–June, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sheidvasser, M.A. The optimal ordering of nodes of an oriented tree. Cybern Syst Anal 8, 504–509 (1972). https://doi.org/10.1007/BF01069008

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation