We study the problem of Embedding Wirelength of n-dimensional Hypercube Qn into Cylinder C2n1×P2n2, where n1+n2=n, called EWHC. We show that such wirelength corresponding to Gray code embedding is 2n2(3⋅22n1−3−2n1−1)+2n1(22n2−1−2n2−1). In addition, we prove that Gray code embedding is an optimal strategy of EWHC.
Cite
@article{arxiv.2201.04287,
title = {Optimal embedding of hypercube into cylinder},
author = {Zhiyi Tang},
journal= {arXiv preprint arXiv:2201.04287},
year = {2022}
}