相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。An O(log2(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes
Mingzu Zhang et al.
IEEE TRANSACTIONS ON RELIABILITY (2018)
Structure fault tolerance of hypercubes and folded hypercubes
Eminjan Sabir et al.
THEORETICAL COMPUTER SCIENCE (2018)
Strong Menger connectivity with conditional faults of folded hypercubes
Weihua Yang et al.
INFORMATION PROCESSING LETTERS (2017)
Optimal construction of node-disjoint shortest paths in folded hypercubes
Cheng-Nan Lai
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2017)
Constructing all shortest node-disjoint paths in torus networks
Cheng-Nan Lai
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2015)
On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
Cheng-Nan Lai
THEORETICAL COMPUTER SCIENCE (2015)
On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
Nai-Wen Chang et al.
IEEE TRANSACTIONS ON COMPUTERS (2014)
Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
Sun-Yuan Hsieh et al.
IEEE TRANSACTIONS ON COMPUTERS (2013)
One-to-many node-disjoint paths of hyper-star networks
Laszlo Liptak et al.
DISCRETE APPLIED MATHEMATICS (2012)
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications
Cheng-Nan Lai
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2012)
One-to-many node-disjoint paths in (n, k)-star graphs
Yonghong Xiang et al.
DISCRETE APPLIED MATHEMATICS (2010)
The spanning connectivity of folded hypercubes
Meijie Ma
INFORMATION SCIENCES (2010)
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Che-Nan Kuo et al.
INFORMATION SCIENCES (2010)
Short containers in Cayley graphs
Shuhong Gao et al.
DISCRETE APPLIED MATHEMATICS (2009)
1-vertex-fault-tolerant cycles embedding on folded hypercubes
Sun-Yuan Hsieh et al.
DISCRETE APPLIED MATHEMATICS (2009)
Many-to-many disjoint paths in faulty hypercubes
Xie-Bin Chen
INFORMATION SCIENCES (2009)
Fault-free cycles in folded hypercubes with more faulty elements
Jung-Sheng Fu
INFORMATION PROCESSING LETTERS (2008)
Some edge-fault-tolerant properties of the folded hypercube
Sun-Yuan Hsieh
NETWORKS (2008)
w-Rabin numbers and strong w-rabin numbers of folded hypercubes
Cheng-Nan Lai et al.
NETWORKS (2008)
The bipanconnectivity and m-panconnectivity of the folded hypercube
Jywe-Fei Fang
THEORETICAL COMPUTER SCIENCE (2007)
Node-disjoint paths in hierarchical hypercube networks
Ruei-Yu Wu et al.
INFORMATION SCIENCES (2007)
On reliability of the folded hypercubes
Qiang Zhu et al.
INFORMATION SCIENCES (2007)
Cycles in folded hypercubes
JM Xu et al.
APPLIED MATHEMATICS LETTERS (2006)
Embedding hamiltonian cycles into folded hypercubes with faulty links
DJ Wang
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2001)
An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
QP Gu et al.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2000)
分享论文
