Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract)

It is shown that, for every k, and for every k-dimensional mesh M, there is a one-to-one embedding of M into its optimum size hypercube with dilation at most 2k-1.

[1]  Mee Yee Chan.  Embedding of Grids into Optimal Hypercubes , 1991, SIAM J. Comput..

[2]  Zevi Miller,et al.  Embedding Grids into Hypercubes , 1992, J. Comput. Syst. Sci..

[3]  Markus Röttger,et al.  Embedding 3-dimensional Grids into Optimal Hypercubes , 1994, Canada-France Conference on Parallel and Distributed Computing.