Fault-tolerant embedding of paths in crossed cubes
暂无分享,去创建一个
Jun-Ming Xu | Meijie Ma | Guizhen Liu | Junming Xu | Meijie Ma | G. Liu
[1] Junming Xu. Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.
[2] Jimmy J. M. Tan,et al. On some super fault-tolerant Hamiltonian graphs , 2004, Appl. Math. Comput..
[3] Jywe-Fei Fang. The bipanconnectivity and m-panconnectivity of the folded hypercube , 2007, Theor. Comput. Sci..
[4] Lih-Hsing Hsu,et al. Edge Congestion and Topological Properties of Crossed Cubes , 2000, IEEE Trans. Parallel Distributed Syst..
[5] Jimmy J. M. Tan,et al. On the Fault-Tolerant Hamiltonicity of Faulty Crossed Cubes , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[6] Kemal Efe. A Variation on the Hypercube with Lower Diameter , 1991, IEEE Trans. Computers.
[7] Jimmy J. M. Tan,et al. Fault-tolerant cycle-embedding of crossed cubes , 2003, Inf. Process. Lett..
[8] Saïd Bettayeb,et al. Embedding Binary Trees into Crossed Cubes , 1995, IEEE Trans. Computers.
[9] Saïd Bettayeb,et al. Multiply-Twisted Hypercube with Five or More Dimensions is not Vertex-Transitive , 1995, Inf. Process. Lett..
[10] Jung-Sheng Fu. Longest fault-free paths in hypercubes with vertex faults , 2006, Inf. Sci..
[11] Xiaohua Jia,et al. Optimal path embedding in crossed cubes , 2005, IEEE Transactions on Parallel and Distributed Systems.
[12] Jun-Ming Xu,et al. Paths in Möbius cubes and crossed cubes , 2006, Inf. Process. Lett..
[13] Xiaohua Jia,et al. Node-pancyclicity and edge-pancyclicity of crossed cubes , 2005, Inf. Process. Lett..
[14] Martin Dietzfelbinger,et al. The linear-array problem in communication complexity resolved , 1997, STOC '97.
[15] Xiaohua Jia,et al. Complete path embeddings in crossed cubes , 2006, Inf. Sci..
[16] Yi Pan,et al. Optimal fault-tolerant embedding of paths in twisted cubes , 2007, J. Parallel Distributed Comput..
[17] J. van Leeuwen,et al. Theoretical Computer Science , 2003, Lecture Notes in Computer Science.
[18] Xiaofan Yang,et al. On the double-vertex-cycle-connectivity of crossed cubes , 2004, Parallel Algorithms Appl..
[19] Xu Jun-ming. Multiply-twisted Hypercube with Four or Less Dimensions is Vertex-transitive , 2005 .
[20] Sun-Yuan Hsieh,et al. Edge-bipancyclicity of a hypercube with faulty vertices and edges , 2008, Discret. Appl. Math..
[21] Kemal Efe,et al. The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..
[22] Jung-Heum Park. Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m, 4) , 2008, Theor. Comput. Sci..
[23] Priyalal Kulasinghe,et al. Connectivity of the Crossed Cube , 1997, Inf. Process. Lett..