Abstract
The past few years have seen a number of results on graph embeddings that deserve to be called breakthroughs because of their settling hard open problems and/or their raising important issues that promise to alter the direction of subsequent research on graph embeddings. We describe and discuss several such results.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
7. References
F. Annexstein, M. Baumslag, A.L. Rosenberg (1987): Group-action graphs and parallel architectures. Submitted for publication.
F. Berman (1983): Parallel computation with limited resources. Johns Hopkins Conf. on Information Sciences and Systems.
F. Bernhart and P.C. Kainen (1979): The book thickness of a graph. J. Comb. Th. (B) 27, 320–331.
S.N. Bhatt and J.-Y. Cai (1987): Take a walk, grow a tree. Typescript, Yale Univ.
S.N. Bhatt, F.R.K. Chung, F.T. Leighton, A.L. Rosenberg (1986): Optimal simulations of tree machines. 27th IEEE Symp. on Foundations of Computer Science, 274–282.
S.N. Bhatt, F.R.K. Chung, J.-W. Hong, F.T. Leighton, A.L. Rosenberg (1988): Optimal simulations by Butterfly networks. 20th ACM Symp. on Theory of Computing, to appear.
F.R.K. Chung, F.T. Leighton, A.L. Rosenberg (1987): Embedding graphs in books: A layout problem with applications to VLSI design. SIAM J. Algebr. Discr. Meth. 8, 33–58.
M.R. Fellows (1985): Encoding graphs in graphs. Ph.D. Dissertation, Univ. California at San Diego.
J. Friedman and N. Pippenger (1986): Expanding graphs contain all small trees: Typescript, IBM Almaden Research Center.
D.S. Greenberg (1987): Minimum expansion embeddings of meshes in hypercubes. Tech. Rpt. DCS/RR-535, Yale Univ.
J.W. Greene and A. El Gamal (1984): Configuration of VLSI arrays in the presence of defects. J. ACM 31, 694–717.
A.K. Gupta and S.E. Hambrusch (1988): Embedding large tree machines into small ones. MIT Conf. on Advanced Research in VLSI.
J. Hastad, F.T. Leighton, M. Newman (1987): Reconfiguring a hypercube in the presence of faults. 19th ACM Symp. on theory of Computing.
L.S. Heath (1987): Embedding outerplanar graphs in small books. SIAM J. Algebr. Discr. Meth. 8, 198–218.
L.S. Heath and S. Istrail (1987): The pagenumber of genus g graphs is O(g). 19th, ACM Symp. on Theory of Computing.
L.S. Heath, A.L. Rosenberg, B.T. Smith (1988): The physical mapping problem for parallel architectures. J. ACM, to appear.
J.-W. Hong, K. Mehlhorn, A.L. Rosenberg (1983): Cost tradeoffs in graph embeddings. J. ACM 30, 709–728.
F.T. Leighton and C.E. Leiserson (1985): Wafer-scale integration of systolic arrays. IEEE Trans. Comp., C-34, 448–461.
S.M. Malitz (1988): Embedding graphs in small books. Manuscript, MIT.
F.P. Preparata and J.E. Vuillemin (1981): The cube-connected cycles: a versatile network for parallel computation. C. ACM 24, 300–309.
A.L. Rosenberg (1983): The Diogenes approach to testable fault-tolerant arrays of processors. IEEE Trans. Comp., C-32, 902–910.
M. Yannakakis (1986): Four pages are necessary and sufficient for planar graphs. 18th ACM Symp. on Theory of Computing, 104–108.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosenberg, A.L. (1988). Graph embeddings 1988: Recent breakthroughs, new directions. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040384
Download citation
DOI: https://doi.org/10.1007/BFb0040384
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96818-6
Online ISBN: 978-0-387-34770-7
eBook Packages: Springer Book Archive