Embedding cycles and meshes onto incomplete hypercubes

References

• Kanevsky , A. and Feng , C. 1995 . On the embedding of cycles in pancake graphs . Parallel Comput. , 21 : 923 – 936 .
   Web of Science ®Google Scholar
• Sen , A. 1989 . Supercube: An optimally fault tolerant network architecture . Acta Inform. , 26 : 741 – 748 .
   Google Scholar
• Das , K. and Mao , A. 1994 . Proceedings of the International Parallel Processing Symposium . A theoretical interconnection network model and the Hamming cube networks . 1994 . pp. 18 – 22 .
   Google Scholar
• Chen , L. and Tzeng , N. F. 1992 . An effective approach to the enhancement of incomplete hypercube computers . Journal of Parallel and Distributed Computing , 14 163 – 174 .
   Google Scholar
• Auletta , A. , Rescigno , A. and Scarano , V. 1995 . Embedding graphs onto the supercube . IEEE Trans. Comput. , 44 ( 4 ) 593 – 597 .
   Web of Science ®Google Scholar
• Fang J.-F. Tang C.-Y. Hsiao J.-Y. Generalized gray codes and related results on inc omplete hypercubes submitted to IEEE Trans. Comput.
   Google Scholar
• Bitner , J. R. , Ehrlich , G. E. and Reingold , M. 1976 . Efficient generation of the binary reflected Gray code and its applications . Commun. ACM , 19 ( 9 ) 517 – 521 .
   Web of Science ®Google Scholar
• Saad , Y. and Schultz , M. H. 1988 . Topological properties of hypercubes . IEEE Trans. Comput. , 37 ( 7 ) 867 – 872 .
   Web of Science ®Google Scholar
• Yang , P.-J. , Tien , S.-B. and Raghavendra , C. S. 1994 . Embedding of rings and meshes onto faulty hypercubes using free dimensions . IEEE Trans. Comput. , 43 ( 5 ) 608 – 613 .
   Web of Science ®Google Scholar
• Akl , S. G. 1989 . The Design and Analysis of Parallel Algorithms , Prentice-Hall .
   Google Scholar
• Tzeng , N.-F. and Chen , H.-L. 1994 . Structural and tree embedding aspects of incomplete hypercubes . IEEE Trans. Comput. , 43 ( 12 ) : 1434 – 1439 .
   Web of Science ®Google Scholar
• Tzeng , N.-F. , Chuang , P.-J. and Chen , H.-L . 1990 . Proc. Int. Conf. Parallel Processing . Embeddings in incomplete hypercubes . 1990 . pp. 335 – 339 .
   Google Scholar
• Horng , M. S. , Chen , D. J. and Ku , K.-L. 1994 . Parallel routing algorithm for incomplete hypercube interconnection networks . Parallel Comput. , 20 1739 – 1761 .
   Web of Science ®Google Scholar
• Katseff , H. P. 1988 . Incomplete hypercubes . IEEE Trans. Comput. , 37 ( 5 ) 604 – 608 .
   Web of Science ®Google Scholar
• Hu , S.-H. and Chen , H.-L. 1994 . An effective routing algorithm in incomplete hypercubes . Parallel Comput. , 20 1721 – 1738 .
   Google Scholar
• Chan , M. Y. and Chin , F. Y. L. 1998 . On embedding rectangular grids in hypercubes . IEEE Trans. Comput. , 37 ( 10 ) 1285 – 1288 .
   Google Scholar
• Ibarra , O. H. and Sohn , S. M. 1990 . On mapping systolic algorithms onto the hypercube . IEEE Trans. Parallel Distrib. Syst. , 1 ( 1 ) 48 – 63 .
   Google Scholar
• O′ Hallaron , D. R. 1991 . Uniform approach for solving some classical problems on a linear array . IEEE Trans. Parallel Distrib. Syst. , 2 ( 2 ) 236 – 241 .
   Google Scholar
• Tan , S. T. and Du , D. H. C. 1993 . Embedded unidirectional incomplete hypercubes for optical networks . IEEE Trans. Communications , 41 ( 9 ) 1284 – 1289 .
   Web of Science ®Google Scholar
• Aleliunas , R. and Rosenberg , A. L. 1982 . On embedding rectangular grids in square grids . IEEE Trans. Comput. , C 31 ( 9 ) 907 – 913 .
   Web of Science ®Google Scholar