Abstract
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.
The research reported here was done while the author was visiting the Department of Computer Science, University of Toronto, Toronto, Ontario, Canada.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Aleliunas and A.L. Rosenberg: On embedding rectangular grids in square grids. Submitted for publication, 1980.
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.
R.P. Brent and H.T. Kung: On the area of binary tree layouts. Australian National University Report TR-CS-79-07, 1979.
A. Cobham: The recognition problem for the set of perfect squares. Proc. 7th SWAT Symp., 1966, 78–87.
F.R.K. Chung and R.L. Graham: On universal graphs for spanning trees. Unpublished typescript, 1979.
F.R.K. Chung and R.L. Graham: Unpublished typescript, 1979.
R.A. DeMillo, S.C. Eisenstat and R.J. Lipton: Preserving average proximity in arrays. C.ACM 21 (1978), 228–231.
—: On small universal data structures and related combinatorial problems. Proc. Johns Hopkins Conf. on Inf. Sci. and Syst., 1978, 408–411.
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.
M.R. Garey, D.S. Johnson and L.J. Stockmeyer: Some simplified NP-complete graph problems. Theor. Comp. Sci. 1 (1976), 237–267.
M.K. Gol'dberg and É.M. Livshits: On minimal universal trees. Math. Notes of Acad. Sci. USSR 4 (1968), 713–717.
L.H. Harper: Optimal numberings and isoperimetric problems on graphs. J. Comb. Th. 1 (1966), 385–393.
J-W.Hong, K. Mehlhorn, and A.L. Rosenberg: Cost tradeoffs in graph embeddings. In preparation.
J-W. Hong and A.L. Rosenberg: Graphs that are similar to binary trees. Submitted for publication, 1980.
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.
C.E. Leiserson: Area-efficient graph layouts. Unpublished typescript, 1979.
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.
R.J. Lipton and R.E. Tarjan: A separator theorem for planar graphs. SIAM J. Appl. Math. 36 (1979), 177–189.
—: Applications of a planar separator theorem. Proc. 18th FOCS Symp., 1977, 162–170.
Ch. H. Papadimitriou: The NP-completeness of the bandwidth minimization problem. Computing 16 (1976), 263–270.
A.L. Rosenberg: Preserving proximity in arrays. SIAM J. Comput. 4 (1975), 443–460.
—: Data encodings and their costs. Acta Inform. 9 (1978), 273–292.
—: Encoding data structures in trees. J.ACM 26 (1979), 668–689.
A.L. Rosenberg and L. Snyder: Bounds on the costs of data encodings. Math. Syst. Th. 12 (1978), 9–39.
—: Perfect storage representations for families of data structures. In preparation, 1980.
A.L. Rosenberg, D. Wood and Z. Galil: Storage representations for tree-like data structures. Math. Syst. Th. 13 (1979), 105–130.
J.B. Saxe: Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. Carnegie-Mellon Tech. Rpt. CMU-CS-80-102, 1980.
M. Sekanina: On an ordering of the set of vertices of a connected graph. Publ. Fac. Sci., Univ. Brno, No.412 (1960), 137–142.
C.D. Thompson: Area-time complexity for VLSI. Proc. 11th ACM STOC Symp., 1979, 81–88.
L.G. Valiant: Universality considerations in VLSI circuits. Unpublished typescript, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosenberg, A.L. (1981). Issues in the study of graph embeddings. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive