Issue No.10 - October (1988 vol.37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.5991
The following graph-embedding question is addressed: given a two-dimensional grid and the smallest hypercube with at least as many nodes as grid points, how can one assign grid points to hypercube nodes (with at most one grid point per node) so as to keep grid neighbors near each other in the cube? An embedding scheme for an infinite class of two-dimensional grids is given that keeps grid neigh
embedding rectangular grids; hypercubes; grid neighbors; two-dimensional grids; graph theory; multiprocessing systems.
M.Y. Chan, "On Embedding Rectangular Grids in Hypercubes", IEEE Transactions on Computers, vol.37, no. 10, pp. 1285-1288, October 1988, doi:10.1109/12.5991