Skip to main content
SpringerLink
Log in

The complexity of embedding graphs into binary trees

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

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

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. Bhatt, S. and S. Cosmadakis; The complexity of minimizing wire lengths in VLSI layouts, manuscript, Lab for Computer Science, MIT, Cambridge, Mass. (1983)

    Google Scholar 

  2. R.A. DeMillo, S.C. Eisenstat and R.J. Lipton: Preserving average proximity in arrays, C.ACM 21 (1978), 228–231

    Google Scholar 

  3. Garey, M.R., R.L. Graham, D.S. Johnson and D.E. Knuth: Complexity results for Badwidth Minimization, SIAM J. Applied Math. 34 (1978), 477–495

    Google Scholar 

  4. Hong, J.W., K. Mehlhorn and A.L. Rosenberg: Cost Trade-offs in Graph embeddings, with Applications, Journal ACM 30 (1983), 709–728

    Google Scholar 

  5. Hong, J.W. and A.L. Rosenberg: Graphs that are almost binary trees, SIAM J. Comp. 11 (1982), 227–242

    Google Scholar 

  6. Paterson, M.S., W.L. Ruzzo and L. Snyder: Bounds on Minimax Edge Length for complete binary trees, ACM Symposium Theory of Computing (1981), 293–299

    Google Scholar 

  7. D. E. Knuth: The Art of Computer Programming I: Fundamental Algorithms, Addison-Wesley, Reading, MA, 1968

    Google Scholar 

  8. R. J. Lipton, S.C. Eisenstat and R.A. DeMillo: Space and time hierarchies for classes of control structures and data structures, J.ACM 23, (1976), 720–732

    Google Scholar 

  9. B. Monien: The complexity of embedding graphs into binary trees, Technical Report, University of Paderborn, 1985

    Google Scholar 

  10. A.L. Rosenberg: Preserving proximity in arrays, SIAM J. Comput. 4, (1975), 443–460

    Google Scholar 

  11. A.L. Rosenberg: Data encodings and their costs, Acta Inform. 9 (1978), 273–292

    Google Scholar 

  12. A.L. Rosenberg: Encoding data structures in trees, J. ACM 26 (1979), 668–689

    Google Scholar 

  13. A. L. Rosenberg and L. Snyder: Bounds on the costs of data encodings, Math. Syst. Th. 12 (1978), 9–39

    Google Scholar 

  14. A.L. Rosenberg, D. Wood and Z. Galil: Storage representations for tree-like data structures, Math. Syst. Th. 13 (1980), 105–130

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Paderborn, Warburgerstraße 100, 4790, Paderborn, West Germany

    B. Monien

Authors
  1. B. Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B. (1985). The complexity of embedding graphs into binary trees. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028814

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation