Skip to main content
SpringerLink
Log in

Optimal tree packing

  • 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. F. Harary, Graph Theory, Addison-Wesley, Reading, Massachusetts (1969).

    Google Scholar 

  2. O. Ore, Theory of Graphs, American Mathematical Society, Providence (1962).

  3. A. A. Korshunov, “On the number of automata, bounded-deterministic functions, and the hereditary properties of automata,” in: Discrete Systems (Transactions of an International Symposium) [in Russian], Riga (1974).

  4. M. A. Harrison, “A census of finite automata,” Canad. J. Math.,17, No. 1 (1965).

    Google Scholar 

Download references

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 89–91, May–June, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V. Optimal tree packing. Cybern Syst Anal 12, 424–427 (1976). https://doi.org/10.1007/BF01070024

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation