Advertisement

The complexity of embedding graphs into binary trees

  • B. Monien
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 199)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    R.A. DeMillo, S.C. Eisenstat and R.J. Lipton: Preserving average proximity in arrays, C.ACM 21 (1978), 228–231Google Scholar
  3. 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–495Google Scholar
  4. 4.
    Hong, J.W., K. Mehlhorn and A.L. Rosenberg: Cost Trade-offs in Graph embeddings, with Applications, Journal ACM 30 (1983), 709–728Google Scholar
  5. 5.
    Hong, J.W. and A.L. Rosenberg: Graphs that are almost binary trees, SIAM J. Comp. 11 (1982), 227–242Google Scholar
  6. 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–299Google Scholar
  7. 7.
    D. E. Knuth: The Art of Computer Programming I: Fundamental Algorithms, Addison-Wesley, Reading, MA, 1968Google Scholar
  8. 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–732Google Scholar
  9. 9.
    B. Monien: The complexity of embedding graphs into binary trees, Technical Report, University of Paderborn, 1985Google Scholar
  10. 10.
    A.L. Rosenberg: Preserving proximity in arrays, SIAM J. Comput. 4, (1975), 443–460Google Scholar
  11. 11.
    A.L. Rosenberg: Data encodings and their costs, Acta Inform. 9 (1978), 273–292Google Scholar
  12. 12.
    A.L. Rosenberg: Encoding data structures in trees, J. ACM 26 (1979), 668–689Google Scholar
  13. 13.
    A. L. Rosenberg and L. Snyder: Bounds on the costs of data encodings, Math. Syst. Th. 12 (1978), 9–39Google Scholar
  14. 14.
    A.L. Rosenberg, D. Wood and Z. Galil: Storage representations for tree-like data structures, Math. Syst. Th. 13 (1980), 105–130Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • B. Monien
    • 1
  1. 1.Universität PaderbornPaderbornWest Germany

Personalised recommendations