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.
- 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
- Grant note
- IEEE Computer Society
- Identifiers
- 081864222X; 9957767095906774
- Academic Unit
- Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
- Language
- English
- Resource Type
- Conference paper
- Publication Details
- Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, pp.285-288