Embedding of meshes in Möbius cubes

Theoretical Computer Science

Volumn 401, Issue 1-3, 2008, Pages 181-190

  Tsai, Chang Hsiung ^a  

^a NATIONAL DONG HWA UNIVERSITY   (Taiwan)

Author keywords

Dilation; Expansion; Interconnection network; Mesh embedding; M bius cubes

Indexed keywords

COMPUTER NETWORKS; METROPOLITAN AREA NETWORKS; NETWORK PROTOCOLS; PAPER;

HYPER CUBES; SIMPLE STRUCTURES;

MICROFLUIDICS;

EID: 45049084122     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.04.023     Document Type: Article

References (20)

1. Auletta L., Rescigno A.A., and Scarano V. Embedding graphs onto the supercube. IEEE Trans. Comput. 44 (1995) 593-597
2. Bae M.M., and Bose B. Edge disjoint Hamiltonian cycles in k-ary n-cubes. IEEE Trans. Comput. 52 (2003) 1271-1284
3. Cull P., and Larson S.M. The Möbius cubes. IEEE Trans. Comput. 44 (1995) 647-659
4. Day K., and Tripathi A. Embedding of cycles in arrangement graphs. IEEE Trans. Comput. 42 (1993) 1002-1006
5. Fan J. Hamilton-connectivity and cycle-embedding of the Möbius cubes. Inform. Process. Lett. 82 (2002) 113-117
6. Fan J., Lin X., and Jia X. Optimal embeddings of paths with various lengths in Twisted cubes. IEEE Trans. Parallel Distrib. Syst. 18 (2007) 511-521
7. Fan J., and Jia X. Embedding meshes into crossed cubes. Inform. Sci. 177 (2007) 3151-3160
8. Fang W.C., Hsu C.C., and Wang C.M. On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks. Inform. Sci. 151 (2003) 51-70
9. Hsieh S.Y., and Chen C.H. Pancyclicity on Möbius cubes with maximal edge faults. Parallel Comput. 30 (2004) 407-421
10. Hsieh S.Y., and Chang N.W. Hamiltonian path embedding and pancyclicity on the Möbius cube with faulty nodes and faulty edges. IEEE Trans. Comput. 55 (2006) 854-863
11. Hsu H.C., Li T.K., Tan J.J.M., and Hsu L.H. Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs. IEEE Trans. Comput. 53 (2004) 39-53
12. Hu K.S., Yeoh S.S., Chen C., and Hsu L.H. Node-pancyclicity and edge-pancyclicity of hypercube variants. Inform. Process. Lett. 102 (2007) 1-7
13. Kulasinghe P., and Bettayeb S. Embedding binary trees into crossed cubes. IEEE Trans. Comput. 44 (1995) 923-929
14. Leighton F.T. Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes (1992), Morgan Kaufmann, San Mateo
15. Park J.H., Lim H.S., and Kim H.C. Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements. Theoret. Comput. Sci. 377 (2007) 170-180
16. Tsai C.H. Linear array and ring embeddings in conditional faulty hypercubes. Theoret. Comput. Sci. 314 (2004) 431-443
17. Wagh M., and Guzide O. Mapping cycles and trees on wrap-around butterfly graphs. SIAM J. Comput. 35 (2006) 741-765
18. Yang P.J., Tien S.B., and Raghavendra C.S. Embedding of rings and meshes onto faulty hypercubes using free dimensions. IEEE Trans. Comput. 43 (1994) 608-613
19. Yang M.C., Li T.K., Jimmy, Tan J.M., and Hsu L.H. Fault-tolerant pancyclicity of the Möbius cubes. IEICE Trans. Fundamentals E88-A (2005) 346-352
20. Yang X., Megson G.M., and Evans D.J. Pancyclicity of Möbius cubes with faulty nodes. Microprocess. Microsyst. 30 (2006) 165-172