A recursively scalable network VLSI implementation
Future Generation Computer Systems
An optimized broadcasting technique for WK-Recursive topologies
Future Generation Computer Systems - Improving perfomance in multiprocessors and networks
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Topological properties of WK-recursive networks
Journal of Parallel and Distributed Computing
Parallel computation: models and methods
Parallel computation: models and methods
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Hamiltonian Connectedness of the Faulty WK-Recursive Network
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Substructure Allocation in Recursive Interconnection Networks
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Efficient Routing and Broadcasting in Recursive Interconnection Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Embedding rings in recursive networks
SPDP '94 Proceedings of the 1994 6th IEEE Symposium on Parallel and Distributed Processing
| Hi-index | 0.00 |
Recently, the WK-recursive network has received much attention due to its many favorable properties such as a high degree of scalability. By K(d,t), we denote the WK-recursive network of level t, each of whose basic modules is a d-node complete graph, where d 1 and t ≥ 1. In this paper, we construct fault-free Hamiltonian cycles in K(d, t) with at most d – 3 faulty nodes, where d ≥ 4. Since the connectivity of K(d, t) is d – 1, the result is optimal.