Abstract
In the following we present embeddings of complete binary trees, pyramids and X-trees into 2-dimensional meshes. The presented embeddings achieve optimal expansion with congestion 2 for trees and congestion 6 for X-trees, and constant expansion ≤3 with congestion 3 for pyramids. The dilations are shown to be near optimal.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
S. Bettayeb, Z. Miller, I.H. Sudborough, "Embedding Grids into Hypercubes", Proc. of 3rd Aegean Workshop On Computing, LNCS 319, 1988, pp.201–211.
J.A. Ellis, "Embedding Rectangular grids into Square Grids", Proc. of. 3rd Aegean Workshop On Computing, LNCS 319, 1988, pp. 181–190.
B. Monien, I.H. Sudborough, "Comparing Interconnection Networks", Proc. of MFCS '88, LNCS 324, 1988, pp.138–153.
M.S. Paterson, W.L. Ruzzo, L. Snyder, "Bounds on minimax edge length for complete binary trees", Proc. of 13th Ann. ACM Theory of Computing Symp. 1981, pp. 293–299
A.L. Rosenberg, "GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions", Proc. of 3rd Aegean Workshop On Computing, LNCS 319, 1988, pp.160–169.
J.D. Ullman, "Computational Aspects of VLSI", Computer Science Press, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zienicke, P. (1991). Embeddings of treelike graphs into 2-dimensional meshes. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_42
Download citation
DOI: https://doi.org/10.1007/3-540-53832-1_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53832-5
Online ISBN: 978-3-540-46310-8
eBook Packages: Springer Book Archive