1. Akers S B, Harel D, Krishnamurthy B. The star graph: An attractive alternative to then-cube. InInt’l. Conf. Parallel Processing, 1987, pp. 393–400.
2. Hong J W, Mehlhorn K, Rosenberg A L. Cost tradeoffs in graph embeddings.J. ACM, 1983, 30(4): 709–728.
3. Chen C Y R, Chung Y C. Embedding networks with ring connections in hypercube machines. InInt’l. Conf. Parallel Processing, 1990, Vol. 3, pp. 327–334.
4. Chan M Y, Chin F Y L. On embedding rectangular grids in hypercubes.IEEE Trans. Computers, 1988, C-37(10): 1285–1288.
5. Chan M Y. Dilation-2 embedding of grids into hypercubes. InInt’l Conf. Parallel Processing, 1988, Vol. 3, pp. 295–298.