Fault-tolerant cycle embedding in the hypercube

DOI10.1016/S0167-8191(03)00058-9zbMath1243.68030OpenAlexW1985051597MaRDI QIDQ436206

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

zbMATH Keywords

hypercubecyclefault toleranceinterconnection networkgraph embedding

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (32)

Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges ⋮ Longest fault-free paths in hypercubes with vertex faults ⋮ Cycles embedding in hypercubes with node failures ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK ⋮ Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks ⋮ Long cycles in hypercubes with optimal number of faulty vertices ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ Hamiltonian fault-tolerance of hypercubes ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ On 4-regular 4-connected bipancyclic subgraphs of hypercubes ⋮ Vertex-fault-tolerant cycles embedding on enhanced hypercube networks ⋮ Embedding of cycles in twisted cubes with edge-pancyclic ⋮ Embedded paths and cycles in faulty hypercubes ⋮ Fault-tolerant cycle embedding in the faulty hypercubes ⋮ Edge-bipancyclicity of a hypercube with faulty vertices and edges ⋮ Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model ⋮ Fault-free Hamiltonian cycles in twisted cubes with conditional link faults ⋮ 1-vertex-fault-tolerant cycles embedding on folded 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 ⋮ Computational complexity of long paths and cycles in faulty hypercubes ⋮ Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Path embedding in faulty hypercubes ⋮ Long paths and cycles in hypercubes with faulty vertices ⋮ Long paths in hypercubes with conditional node-faults ⋮ Fault-tolerant cycles embedding in folded hypercubes ⋮ Survey on path and cycle embedding in some networks ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model ⋮ Path coverings with prescribed ends in faulty hypercubes

This page was built for publication: Fault-tolerant cycle embedding in the hypercube