Fault-tolerant cycle embedding in the hypercube
From MaRDI portal
Publication:436206
DOI10.1016/S0167-8191(03)00058-9zbMATH Open1243.68030OpenAlexW1985051597MaRDI QIDQ436206FDOQ436206
Authors: Jung-Sheng Fu
Publication date: 30 July 2012
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(03)00058-9
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cited In (41)
- Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges
- Conditional edge-fault Hamiltonicity of augmented cubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- Long cycles in hypercubes with optimal number of faulty vertices
- Fault-tolerant cycle embedding in the faulty hypercubes
- Efficient unicast in bijective connection networks with the restricted faulty node set
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- Cycles embedding in hypercubes with node failures
- Path coverings with prescribed ends in faulty hypercubes
- Edge-bipancyclicity of a hypercube with faulty vertices and edges
- Long paths in hypercubes with conditional node-faults
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes
- Survey on path and cycle embedding in some networks
- Path embedding in faulty hypercubes
- Bipanconnectivity of faulty hypercubes with minimum degree
- Embedding of cycles in twisted cubes with edge-pancyclic
- On ring embedding in hypercubes with faulty nodes and links
- Regular connected bipancyclic spanning subgraphs of torus networks
- Longest fault-free paths in hypercubes with vertex faults
- EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE
- Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model
- Computational complexity of long paths and cycles in faulty hypercubes
- A note on cycle embedding in hypercubes with faulty vertices
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- The congestion of generalized cube communication pattern in linear array network
- Hamming Codes, Hypercube Embeddings, and Fault Tolerance
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
- Hamiltonian fault-tolerance of hypercubes
- Fault-tolerant cycles embedding in folded hypercubes
- Embedding cube-connected cycles graphs into faulty hypercubes
- Fault-tolerant cycle embedding in hierarchical cubic networks
- Title not available (Why is that?)
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- On the reconfigurability of embedded loops on hypercubes and its application
- Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- On 4-regular 4-connected bipancyclic subgraphs of hypercubes
- Embedding a long fault-free cycle in a crossed cube with more faulty nodes
- Long paths and cycles in hypercubes with faulty vertices
- Vertex-fault-tolerant cycles embedding on enhanced hypercube networks
- Embedded paths and cycles in faulty hypercubes
This page was built for publication: Fault-tolerant cycle embedding in the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436206)