Hamiltonian paths in hypercubes with local traps
暂无分享,去创建一个
[1] Jun-Ming Xu,et al. Edge-fault-tolerant edge-bipancyclicity of hypercubes , 2005, Inf. Process. Lett..
[2] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .
[3] Yue-Li Wang,et al. Hamiltonian cycles in hypercubes with faulty edges , 2014, Inf. Sci..
[4] Sun-Yuan Hsieh,et al. Conditional edge-fault Hamiltonicity of augmented cubes , 2010, Inf. Sci..
[5] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[6] Xiaola Lin,et al. Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers , 1994, IEEE Trans. Parallel Distributed Syst..
[7] Xie-Bin Chen,et al. A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges , 2008, Inf. Process. Lett..
[8] Kyung-Yong Chwa,et al. Paired many-to-many disjoint path covers in faulty hypercubes , 2013, Theor. Comput. Sci..
[9] Jimmy J. M. Tan,et al. Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position , 2008, Inf. Process. Lett..
[10] Jung-Sheng Fu,et al. Fault-free Hamiltonian cycles in crossed cubes with conditional link faults , 2007, Inf. Sci..
[11] Andrzej Szepietowski. Hamiltonian cycles in hypercubes with 2n-4 faulty edges , 2012, Inf. Sci..
[12] Jimmy J. M. Tan,et al. Edge-bipancyclicity of conditional faulty hypercubes , 2007, Inf. Process. Lett..
[13] Andrzej Szepietowski,et al. Hamiltonian cycles in hypercubes with faulty edges , 2018, Int. J. Comput. Math. Comput. Syst. Theory.
[14] Jun-Ming Xu,et al. Edge-fault-tolerant bipanconnectivity of hypercubes , 2009, Inf. Sci..
[15] William Y. C. Chen,et al. Derangements on the n-cube , 1993, Discret. Math..
[16] Xie-Bin Chen,et al. Paired many-to-many disjoint path covers of hypercubes with faulty edges , 2012, Inf. Process. Lett..
[17] Xie-Bin Chen,et al. Many-to-many disjoint paths in faulty hypercubes , 2009, Inf. Sci..
[18] Mee Yee Chan,et al. On the Existence of Hamiltonian Circuits in Faulty Hypercubes , 1991, SIAM J. Discret. Math..
[19] Sun-Yuan Hsieh,et al. Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes , 2007, Comput. Math. Appl..
[20] Yi-Ping Hung,et al. Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model , 2009, J. Syst. Archit..
[21] Jung-Sheng Fu. Vertex-pancyclicity of augmented cubes with maximal faulty edges , 2014, Inf. Sci..
[22] Jimmy J. M. Tan,et al. Long paths in hypercubes with conditional node-faults , 2009, Inf. Sci..
[23] Jun-Ming Xu,et al. A note on cycle embedding in hypercubes with faulty vertices , 2011, Inf. Process. Lett..
[24] Jimmy J. M. Tan,et al. Fault-tolerant hamiltonian laceability of hypercubes , 2002, Inf. Process. Lett..
[25] Jung-Sheng Fu. Longest fault-free paths in hypercubes with vertex faults , 2006, Inf. Sci..
[26] Sun-Yuan Hsieh,et al. Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults , 2010, J. Comb. Optim..
[27] Ming-Chien Yang,et al. Bipanconnectivity of balanced hypercubes , 2010, Comput. Math. Appl..
[28] Petr Gregor,et al. Path partitions of hypercubes , 2008, Inf. Process. Lett..
[29] Chang-Hsiung Tsai. Linear array and ring embeddings in conditional faulty hypercubes , 2004, Theor. Comput. Sci..
[30] Xie-Bin Chen,et al. Paired many-to-many disjoint path covers of the hypercubes , 2013, Inf. Sci..
[31] Sajal K. Das,et al. Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.
[32] Tzung-Shi Chen,et al. A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks , 2002, J. Parallel Distributed Comput..
[33] Sun-Yuan Hsieh,et al. Pancyclicity and bipancyclicity of conditional faulty folded hypercubes , 2010, Inf. Sci..