Skip to main content
SpringerLink
Log in

Hamiltonian cycles in layout problems

  • 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, Sibirsk. Otd., Novosibirsk (1969).

    Google Scholar 

  2. V. I. Mudrov, The Travelling-Salesman Problem [in Russian], Znanie, Ser. Mat. Kibernet., No. 10, Moscow (1969).

  3. Zh. N. Zaitseva and M. E. Shtein, “Construction of optimal Hamiltonian cycles in multivertex graphs,” Kibernetika, No. 6 (1975).

  4. V. A. Rozanov, “Analysis of methods for solving the layout problem,” in: Problems of Automation and Production of Computers [in Russian], Vol. 16, Pt. 1 Izd. MIÉM, Moscow (1971).

    Google Scholar 

Download references

Authors
  1. Zh. N. Zaitseva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. E. Shtein
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 70–73, May–June, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zaitseva, Z.N., Shtein, M.E. Hamiltonian cycles in layout problems. Cybern Syst Anal 12, 405–408 (1976). https://doi.org/10.1007/BF01070021

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation