Sciweavers

10 search results - page 1 / 2
» Fault-tolerant graphs for hypercubes and tori
Sort
View
APPML
2005
68views more  APPML 2005»
13 years 5 months ago
A note on edge fault tolerance with respect to hypercubes
In the previous studies on k-edge fault tolerance with respect to hypercubes Qn, matrices for generating linear k-EFT(Qn) graphs were used. Let EFTL(n, k) denote the set of matric...
Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu
IPPS
1998
IEEE
13 years 9 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani
ISPAN
2002
IEEE
13 years 10 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
COCOON
2006
Springer
13 years 9 months ago
Optimal Acyclic Edge Colouring of Grid Like Graphs
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
Rahul Muthu, N. Narayanan, C. R. Subramanian
HICSS
1995
IEEE
98views Biometrics» more  HICSS 1995»
13 years 8 months ago
Fault-tolerant graphs for hypercubes and tori
Toshinori Yamada, Koji Yamamoto, Shuichi Ueno