Skip to main content
SpringerLink
Log in

Minimal numberings of the vertices of trees — Approximate approach

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Hanan and J.M. Kurtzberg, A review of the placement and quadratic assignment problems. SIAM Rev. 14,324–342(1972).

    Google Scholar 

  2. P.Z. Chinn, J. Chvatalova, A.K. Dewdney and N.E. Gibbs, The bandwidth problem for graphs and matrices — a survey. J. Graph Theory 6,223–254(1982).

    Google Scholar 

  3. M.K. Goldberg and I.A. Klipker, Minimal placing of trees on a line. Technical repot. Physico-Technical Institute of Low Temperatures, Academy of Sciences of Ukranian SSR, USSR(in Russian)(1976).

    Google Scholar 

  4. Y. Shiloach, A minimum linear arrangement algorithm for undirected trees. SIAM J. Comp. 8,15–32(1979).

    Google Scholar 

  5. F.R.K. Chung, On optimal linear arrangements of trees. Comp.& Maths. with Appls. 10,43–60(1984).

    Google Scholar 

  6. M.A. Iordanskii, Minimal planar arrangements of trees. Diskr. Anal. 33,3–30(in Russian)(1979).

    Google Scholar 

  7. M.A. Iordanskii, Minimal numberings of the vertices of trees. Sov. Math. Dokl. 15,1311–1315(1974).

    Google Scholar 

  8. M.A. Iordanskii, Minimal numberings of the vertices of trees. Problemy Kibernet. 31,109–131(In Russian)(1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gorky State Pedagogical Institute, 603005, Gorky, USSR

    M. A. Iordanskii

Authors
  1. M. A. Iordanskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iordanskii, M.A. (1987). Minimal numberings of the vertices of trees — Approximate approach. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation