Optimal Embedding of Complete Binary Trees into Lines and Grids

We consider several graph embedding problems which have applications in parallel and distributed computing and which have been unsolved so far. Our major result is that the complete binary tree can be embedded into the square grid of the same size with almost optimal dilation (up to a very small factor). To achieve this, we first state an embedding of the complete binary tree into the line with optimal dilation.

[1]  B. Monien.  The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete , 1986 .

[2]  Arnold L. Rosenberg,et al.  On Embedding Rectangular Grids in Square Grids , 1982, IEEE Transactions on Computers.

[3]  Dan Gordon.  Efficient Embeddings of Binary Trees in VLSI Arrays , 1987, IEEE Transactions on Computers.

[4]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[5]  Burkhard Monien,et al.  Embedding one interconnection network in another , 1990 .

[6]  John A. Ellis.  Embedding Rectangular Grids into Square Grids , 1991, IEEE Trans. Computers.

[7]  Arnold L. Rosenberg.  GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions , 1988, AWOC.

[8]  Mikhail J. Atallah,et al.  Optimal simulations between mesh-connected arrays of processors , 1988, JACM.

[9]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[10]  Peter Zienicke.  Embeddings of Treelike Graphs into 2-Dimensional Meshes , 1990, WG.

[11]  Fillia Makedon,et al.  Approximation algorithms for the bandwidth minimization problem for caterpillar graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[12]  Lawrence Snyder,et al.  Bounds on minimax edge length for complete binary trees , 1981, STOC '81.

[13]  W. L. Ruzzo,et al.  Minimum Edge Length Planar Embeddings of Trees , 1981 .

[14]  Burkhard Monien.  Simulating binary trees on X-trees (extended abstract) , 1991, SPAA '91.