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
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
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
Cycles embedding in hypercubes with node failures
Information Processing Letters
Conditional fault Hamiltonicity of the complete graph
Information Processing Letters
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
A note on cycle embedding in folded hypercubes with faulty elements
Information Processing Letters
Fault-free cycles in folded hypercubes with more faulty elements
Information Processing Letters
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
1-vertex-fault-tolerant cycles embedding on folded hypercubes
Discrete Applied Mathematics
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
An optimal result on fault-tolerant cycle-embedding in alternating group graphs
Information Processing Letters
Two-node-Hamiltonicity of enhanced pyramid networks
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
A note on cycle embedding in hypercubes with faulty vertices
Information Processing Letters
Theoretical Computer Science
Fault-tolerant path embedding in folded hypercubes with both node and edge faults
Theoretical Computer Science
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Fault-tolerant cycle embedding in the faulty hypercubes
Information Sciences: an International Journal
| Hi-index | 0.00 |
Let f"v (respectively, f"e) 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 2^n-2f"v can be embedded in an n-dimensional hypercube with f"e=0 or f"e=