Issues in the study of graph embeddings

  • Arnold L. Rosenberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 100)


We discuss a number of problem areas that are basic to any computation-motivated study of graph embeddings and their costs; and we illustrate each topic with one or two recent results in that area. Included among the discussed areas are: similarity of families of graphs, generic families of graphs, and tradeoffs among the costs of an embedding.


Binary Tree Cost Measure Outerplanar Graph Graph Embedding Complete Binary Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Aleliunas and A.L. Rosenberg: On embedding rectangular grids in square grids. Submitted for publication, 1980.Google Scholar
  2. [2]
    A. Borodin, M.J. Fischer, D. Kirkpatrick, N.A. Lynch, M. Tompa: A time-space tradeoff for sorting on nonoblivious machines. Proc. 20th FOCS Symp., 1979, 319–327.Google Scholar
  3. [3]
    R.P. Brent and H.T. Kung: On the area of binary tree layouts. Australian National University Report TR-CS-79-07, 1979.Google Scholar
  4. [4]
    A. Cobham: The recognition problem for the set of perfect squares. Proc. 7th SWAT Symp., 1966, 78–87.Google Scholar
  5. [5]
    F.R.K. Chung and R.L. Graham: On universal graphs for spanning trees. Unpublished typescript, 1979.Google Scholar
  6. [6]
    F.R.K. Chung and R.L. Graham: Unpublished typescript, 1979.Google Scholar
  7. [7]
    R.A. DeMillo, S.C. Eisenstat and R.J. Lipton: Preserving average proximity in arrays. C.ACM 21 (1978), 228–231.Google Scholar
  8. [8]
    —: On small universal data structures and related combinatorial problems. Proc. Johns Hopkins Conf. on Inf. Sci. and Syst., 1978, 408–411.Google Scholar
  9. [9]
    M.R. Garey, R.L. Graham, D.S. Johnson and D.E. Knuth: Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34 (1978), 477–495.Google Scholar
  10. [10]
    M.R. Garey, D.S. Johnson and L.J. Stockmeyer: Some simplified NP-complete graph problems. Theor. Comp. Sci. 1 (1976), 237–267.Google Scholar
  11. [11]
    M.K. Gol'dberg and É.M. Livshits: On minimal universal trees. Math. Notes of Acad. Sci. USSR 4 (1968), 713–717.Google Scholar
  12. [12]
    L.H. Harper: Optimal numberings and isoperimetric problems on graphs. J. Comb. Th. 1 (1966), 385–393.Google Scholar
  13. [13]
    J-W.Hong, K. Mehlhorn, and A.L. Rosenberg: Cost tradeoffs in graph embeddings. In preparation.Google Scholar
  14. [14]
    J-W. Hong and A.L. Rosenberg: Graphs that are similar to binary trees. Submitted for publication, 1980.Google Scholar
  15. [15]
    H.T. Kung and D. Stevenson: A software technique for reducing the routing time on a parallel computer with a fixed interconnection network. In High Speed Computer and Algorithm Optimization, Academic Press, New York (1977), 423–433.Google Scholar
  16. [16]
    C.E. Leiserson: Area-efficient graph layouts. Unpublished typescript, 1979.Google Scholar
  17. [17]
    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
  18. [18]
    R.J. Lipton and R.E. Tarjan: A separator theorem for planar graphs. SIAM J. Appl. Math. 36 (1979), 177–189.Google Scholar
  19. [19]
    —: Applications of a planar separator theorem. Proc. 18th FOCS Symp., 1977, 162–170.Google Scholar
  20. [20]
    Ch. H. Papadimitriou: The NP-completeness of the bandwidth minimization problem. Computing 16 (1976), 263–270.Google Scholar
  21. [21]
    A.L. Rosenberg: Preserving proximity in arrays. SIAM J. Comput. 4 (1975), 443–460.Google Scholar
  22. [22]
    —: Data encodings and their costs. Acta Inform. 9 (1978), 273–292.Google Scholar
  23. [23]
    —: Encoding data structures in trees. J.ACM 26 (1979), 668–689.Google Scholar
  24. [24]
    A.L. Rosenberg and L. Snyder: Bounds on the costs of data encodings. Math. Syst. Th. 12 (1978), 9–39.Google Scholar
  25. [25]
    —: Perfect storage representations for families of data structures. In preparation, 1980.Google Scholar
  26. [26]
    A.L. Rosenberg, D. Wood and Z. Galil: Storage representations for tree-like data structures. Math. Syst. Th. 13 (1979), 105–130.Google Scholar
  27. [27]
    J.B. Saxe: Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. Carnegie-Mellon Tech. Rpt. CMU-CS-80-102, 1980.Google Scholar
  28. [28]
    M. Sekanina: On an ordering of the set of vertices of a connected graph. Publ. Fac. Sci., Univ. Brno, No.412 (1960), 137–142.Google Scholar
  29. [29]
    C.D. Thompson: Area-time complexity for VLSI. Proc. 11th ACM STOC Symp., 1979, 81–88.Google Scholar
  30. [30]
    L.G. Valiant: Universality considerations in VLSI circuits. Unpublished typescript, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Arnold L. Rosenberg
    • 1
  1. 1.Mathematical Sciences DepartmentIBM Watson Research CenterYorktown HeightsUSA

Personalised recommendations