Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Distributed fault-tolerant embeddings of rings in hypercubes
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Topics in distributed algorithms
Topics in distributed algorithms
Fault-Tolerant Ring Embedding in de Bruijn Networks
IEEE Transactions on Computers
Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
On the embedding of a class of regular graphs in a faulty hypercube
Journal of Parallel and Distributed Computing
Embedding a ring in a hypercube with both faulty links and faulty nodes
Information Processing Letters
Parallel computation: models and methods
Parallel computation: models and methods
On ring embedding in hypercubes with faulty nodes and links
Information Processing Letters
An optimal embedding of cycles into incomplete hypercubes
Information Processing Letters
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
IEEE Transactions on Computers
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes
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
Embed Longest Rings onto Star Graphs with Vertex Faults
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
On some topological properties of hypercube, incomplete hypercube and supercube
IPPS '93 Proceedings of the 1993 Seventh International Parallel Processing Symposium
| Hi-index | 0.00 |
Let fv (respectively, fe) denote the number of faulty vertices (respectively, edges) in an n-dimensional hypercube. In this paper, we show that a fault-free cycle of length of at least 2n–2fv can be embedded in an n-dimensional hypercube with fe ≤ n – 2 and fv + fe ≤ 2n – 4. Our result not only improves the previously best known result of Sengupta (1998) where fv 0 or fe ≤ n – 2 and fv + fe ≤ n – 1 were assumed, but also extends the result of Fu (2003) where only the faulty vertices are considered.