Abstract
We describe how to embed an arbitrary binary tree with dilation 3 and O(1) expansion into a hypercube. (In fact, we show that all binary trees can be embedded into their optimal hypercube with dilation 3, provided that all binary trees with no more than B vertices, for some fixed number B, can be embedded with dilation 3.) We also show how to embed all binary trees into their optimal hypercube with dilation 5.
The work of this author was partly done during a visit to UTD and was supported by a grant from the German Research Association (DFG).
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”, IEEE Trans. on Computers, C-31,9 (1982), pp. 907–913.
S. Bettayeb, Z. Miller, and I. H. Sudborough, ”Embedding Grids into Hypercubes”, these proceedings.
S. N. Bhatt, and I. C. F. Ipsen, ”How to Embed Trees in Hypercubes”, Research Report YALEU/DCS/RR-443, Yale University, Dept. of Computer Science, 1985.
S. Bhatt, F. Chung, T. Leighton, and A. Rosenberg, ”Optimal Simulation of Tree Machines”, Proc. 27th Annual IEEE Symp. Foundations of Computer Sci., Oct. 1986, pp. 274–282.
S. Bhatt, F. Chung, J.-W. Hong, T. Leighton, A. Rosenberg, ”Optimal Simulations by Butterfly Networks”, Proc. 20th Annual ACM Theory of Computing Symp., 1988, to appear.
M. Y. Chan, ”Dilation 2 Embedding of Grids into Hypercubes”, Tech. Report, Computer Science Program, Univ. Texas at Dallas, 1988.
M. Y. Chan and F. Y. L. Chin, ”On Embedding Rectangular Grids in Hypercubes”, to appear in IEEE Trans. on Computers.
J. A. Ellis, ”Embedding Rectangular grids into Square Grids”, these proceedings.
I. Havel and P. Liebl, ”One Legged Caterpillars Span Hypercubes”, J. Graph Theory, 10 (1986), pp. 69–76.
I. Havel, ”On Hamiltonian Circuits and Spanning Trees of Hypercubes”, Cas. Pest. Mat. (in Czech.), 109 (1984), pp. 135–152.
B. Monien, G. Spenner, W. Unger, and G. Wechsung, “On the Edge Length of Embedding Caterpillars into Various Networks”, manuscript, Dept. of Math. and Computer Science, Univ. Paderborn, Paderborn, W. Germany, 1988.
L. Nebesky, ”On Cubes and Dichotomic Trees”, Cas. Pest. Mat. (in Czech.), 99 (1974), pp. 164–167.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monien, B., Sudborough, I.H. (1988). Simulating binary trees on hypercubes. 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/BFb0040385
Download citation
DOI: https://doi.org/10.1007/BFb0040385
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