Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel computation: models and methods
Parallel computation: models and methods
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model
Journal of Systems Architecture: the EUROMICRO Journal
Conditional Fault-Tolerant Hamiltonicity of Twisted Cubes
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Conditional Fault-Tolerant Hamiltonicity of Star Graphs
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Conditional Fault-Tolerant Cycle-Embedding of Crossed Cube
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we sketch structure characterization of a class of networks, called Matching Composition Networks (MCNs), to establish necessary conditions for determining the conditional fault hamiltonicity. We then apply our result to n-dimensional restricted hypercube-like networks, including n-dimensional crossed cubes, and n-dimensional locally twisted cubes, to show that there exists a fault-free Hamiltonian cycle if there are at most 2n - 5 faulty edges in which each node is incident to at least two fault-free edges. We also demonstrate that our result is worst-case optimal with respect to the number of faulty edges tolerated.