Fault-tolerant cycle embedding in the hypercube

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

Jung-Sheng Fu

Publication date: 30 July 2012

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

hypercube; cycle; fault tolerance; interconnection network; graph embedding

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Embedded paths and cycles in faulty hypercubes, Paired many-to-many disjoint path covers in faulty hypercubes, Bipanconnectivity of faulty hypercubes with minimum degree, 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, Long paths and cycles in hypercubes with faulty vertices, Longest fault-free paths in hypercubes with vertex faults, Cycles embedding in hypercubes with node failures, Embedding of cycles in twisted cubes with edge-pancyclic, Edge-bipancyclicity of a hypercube with faulty vertices and edges, Fault-free Hamiltonian cycles in twisted cubes with conditional link faults, 1-vertex-fault-tolerant cycles embedding on folded hypercubes, Conditional edge-fault Hamiltonicity of augmented cubes, Path embedding in faulty hypercubes, Long paths in hypercubes with conditional node-faults, Survey on path and cycle embedding in some networks, Long cycles in hypercubes with optimal number of faulty vertices, A note on cycle embedding in hypercubes with faulty vertices, Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults, Hamiltonian fault-tolerance of hypercubes