ESFAHANIAN A H. Generalized measures of fault tolerance with application to N-cube networks. IEEE Trans Comput. 1989, 38(11): 1586-1591.
[2]
LALIFI S. Combinatorial analysis of the fault diameter of the n-cube. IEEE Trans Comput. 1993, 42(1): 27-33.
[3]
TIEN Sing-Ban. RAGHAVENDRA C S. Algorithms and bounds for shortest paths and diameter in faulty hypercuhes[J]. IEEE Trans Parallel and Distributed Systems, 1993, 4(6): 713-718.
[4]
QIAN Ping. PENG Shietung. An efficient algorithm for node-to-node routing in hypercubes with faulty clusters[J]. The Computer Journal, 1996, 39(1): 14-19.
