
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Dajin Wang, "On Embedding Hamiltonian Cycles in Crossed Cubes," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 3, pp. 334346, March, 2008.  
BibTex  x  
@article{ 10.1109/TPDS.2007.70729, author = {Dajin Wang}, title = {On Embedding Hamiltonian Cycles in Crossed Cubes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {19}, number = {3}, issn = {10459219}, year = {2008}, pages = {334346}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.70729}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  On Embedding Hamiltonian Cycles in Crossed Cubes IS  3 SN  10459219 SP334 EP346 EPD  334346 A1  Dajin Wang, PY  2008 KW  Crossed cube KW  Embedding KW  Hamiltonian cycles KW  Interconnection architectures KW  Network topology VL  19 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] E. Abuelrub and S. Bettayeb, “Embedding Rings into Faulty Twisted Hypercubes,” Computers and Artificial Intelligence, vol. 16, pp. 425441, 1997.
[2] M.M. Bae and B. Bose, “Edge Disjoint Hamiltonian Cycles in $k\hbox{}{\rm ary}\;n\hbox{}{\rm cubes}$ and Hypercubes,” IEEE Trans. Computers, vol. 52, no. 10, pp. 12711284, Oct. 2003.
[3] R.V. Boppana, S. Chalasani, and C.S. Raghavendra, “Resource Deadlock and Performance of Wormhole Multicast Routing Algorithms,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 6, pp. 535549, June 1998.
[4] C.P. Chang, T.Y. Sung, and L.H. Hsu, “Edge Congestion and Topological Properties of Crossed Cube,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 1, pp. 6480, Jan. 2000.
[5] E. Dixon and S. Goodman, “On the Number of Hamiltonian Circuits in the nCube,” Proc. Am. Math. Soc., pp. 500504, 1975.
[6] K. Efe, “The Crossed Cube Architecture for Parallel Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513524, Sept. 1992.
[7] K. Efe, P.K. Blackwell, W. Slough, and T. Shiau, “Topological Properties of the Crossed Cube Architecture,” Parallel Computing, vol. 20, pp. 17631775, 1994.
[8] K. Efe and A. Fernandez, “Products of Networks with Logarithmic Diameter and Fixed Degree,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 9, pp. 963975, Sept. 1995.
[9] J. Fan, “Diagnosability of Crossed Cubes under the Comparison Diagnosis Model,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 10, pp. 10991104, Oct. 2002.
[10] J. Fan, X. Lin, and X. Jia, “Optimal Path Embedding in Crossed Cubes,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 12, pp. 11901200, Dec. 2005.
[11] J.S. Fu, “Hamiltonicity of the WKRecursive Network with and without Faulty Nodes,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 9, pp. 853865, Sept. 2005.
[12] F. Harary, “A Survey of Hypercube Graphs,” Computers and Math. Applications, 1989.
[13] S.Y. Hsieh, C.W. Ho, and G.H. Chen, “FaultFree Hamiltonian Cycles in Faulty Arrangement Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 223237, Mar. 1999.
[14] H.C. Hsu, T.K. Li, J.J.M. Tan, and L.H. Hsu, “Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs,” IEEE Trans. Computers, vol. 53, no. 1, pp. 3953, Jan. 2004.
[15] W.T. Huang, W.K. Chen, and C.H. Chen, “On the FaultTolerant Pancyclicity of Crossed Cubes,” Proc. Ninth Int'l Conf. Parallel and Distributed Systems, p. 483, 2002.
[16] W.T. Huang, Y.C. Chuang, J.M. Tan, and L.H. Hsu, “On the FaultTolerant Hamiltonicity of Faulty Crossed Cubes,” IEICE Trans. Fundamentals, vol. E85A, no. 6, pp. 13591370, June 2002.
[17] W.T. Huang, J.J.M. Tan, C.N. Hung, and L.H. Hsu, “FaultTolerant Hamiltonicity of Twisted Cubes,” J. Parallel and Distributes Computing, vol. 62, pp. 591604, 2002.
[18] R.S. Lo and G.H. Chen, “Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 2, pp. 209222, Feb. 2001.
[19] P. Kulasinghe, “Connectivity of the Crossed Cube,” Information Processing Letters, vol. 61, pp. 221226, Feb. 1997.
[20] P. Kulasinghe and S. Bettayeb, “Embedding Binary Trees into Crossed Cube,” IEEE Trans. Computers, vol. 44, no. 7, pp. 923929, July 1995.
[21] X. Lin, P.K. Mckinley, and L.M. Ni, “DeadlockFree Multicast Wormhole Routing in 2D Mesh Multicomputers,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 793804, Aug. 1994.
[22] D. Wang, “Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links,” J. Parallel and Distributed Systems, vol. 61, no. 4, pp. 545564, 2001.
[23] M.C. Yang, T.K. Li, J.M. Tan, and L.H. Hsu, “FaultTolerant CycleEmbedding of Crossed Cubes,” Information Processing Letters, vol. 88, no. 4, pp. 149154, Nov. 2003.
[24] S.Q. Zheng and S. Latifi, “Optimal Simulation of Linear Multiprocessor Architectures on MultiplyTwisted Cube Using Generalized Gray Code,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 6, pp. 612619, June 1996.