Abstract
We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its optimal hypercube on a one-to-one basis with dilation at most 5. © 1996 Academic Press, Inc.
- Title
- Dilation-5 embedding of 3-dimensional grids into hypercubes
- Creators - without role
- M.Y. Chan - University of Hong KongF. Chin - University of Hong KongC.N. Chu - University of Hong KongW.K. Mak - University of Hong Kong
- Publication Details
- Journal of Parallel and Distributed Computing, Vol.33(1), pp.98-106
- Identifiers
- 9957768916706774
- Academic Unit
- Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
- Language
- English
- Resource Type
- Journal article