Title :
On embedding rectangular grids in hypercubes
Author :
Chan, M.Y. ; Chin, F.Y.L.
Author_Institution :
Dept. of Comput. Studies, Hong Kong Univ., Hong Kong
fDate :
10/1/1988 12:00:00 AM
Abstract :
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 neighbors within a distance of two apart
Keywords :
graph theory; multiprocessing systems; embedding rectangular grids; grid neighbors; hypercubes; two-dimensional grids; Binary trees; Computational modeling; Concurrent computing; Costs; Hypercubes; Labeling; Network topology; Reflective binary codes; Time measurement; Tree graphs;
Journal_Title :
Computers, IEEE Transactions on
