A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On the fault-diameter of the star graph
Information Processing Letters
Information Processing Letters
Fault tolerance of the star graph interconnection network
Information Processing Letters
Node-to-node cluster fault tolerant routing in star graphs
Information Processing Letters
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
A Parallel Algorithm for Computing Fourier Transforms on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
Given a graph G, a cluster C is a connected subgraph of G, and C is called a faulty cluster if all nodes in C are faulty. Given an n-dimensional star graph G/sub n/ with n-2 faulty clusters of diameter at most 2, it has been shown by the authors (1994) that any two non-faulty nodes s and t of G/sub n/ can be connected by a fault-free path of length at most d(G/sub n/)+6 in O(n/sup 2/) time, where d(G/sub n/)=[(3(n-1))/2] is the diameter of G/sub n/. In this paper, we prove that a fault-free path s/spl rarr/t of length at most d(G/sub n/)+1 if n10 or n is odd, or d(G/sub n/)+2 otherwise, can be found in O(n/sup 2/) time. The length of the path s/spl rarr/t is optimal.