Sciweavers

38 search results - page 4 / 8
» Hamiltonian fault-tolerance of hypercubes
Sort
View
ISPAN
2002
IEEE
15 years 2 months ago
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen
86
Voted
APCSAC
2005
IEEE
15 years 3 months ago
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
Zhang Xinhua, Peter Loh
75
Voted
FOCS
1992
IEEE
15 years 1 months ago
On the Fault Tolerance of Some Popular Bounded-Degree Networks
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...
Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. ...
67
Voted
AMC
2007
127views more  AMC 2007»
14 years 9 months ago
Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
The balanced hypercube BHn is a variant of the hypercube Qn. Huang and Wu proved that BHn has better properties than Qn with the same number of links and processors. In particular...
Min Xu, Xiao-Dong Hu, Jun-Ming Xu
79
Voted
ISCI
2007
82views more  ISCI 2007»
14 years 9 months ago
On reliability of the folded hypercubes
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n À 2 for n P 8; and k2(FQn) = 3n À 1 for n...
Qiang Zhu 0003, Jun-Ming Xu, Xinmin Hou, Min Xu