✦ LIBER ✦

Minimum wirelength of hypercubes into n-dimensional grid networks

✍ Scribed by Indra Rajasingh; Micheal Arockiaraj; Bharati Rajan; Paul Manuel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dilation-5 Embedding of 3-Dimensional Gr

✍ M.Y. Chan; F. Chin; C.N. Chu; W.K. Mak 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 271 KB

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.