Fault-tolerant cycles embedding in hypercubes with faulty edges (original) (raw)
Related papers
Vertex-fault-tolerant cycles embedding in balanced hypercubes
Information Sciences, 2014
Hamiltonian cycles in hypercubes with faulty edges
Information Sciences an International Journal, 2014
Cycles embedding in balanced hypercubes with faulty edges and vertices
Discrete Applied Mathematics, 2018
Odd cycles embedding on folded hypercubes with conditional faulty edges
Information Sciences, 2014
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
Inf. Process. Lett., 2021
Cycles embedding in folded hypercubes under the conditional fault model
Discrete Applied Mathematics, 2017
Hamiltonicity of hypercubes with a constraint of required and faulty edges
Journal of Combinatorial Optimization, 2007
A further result on fault-free cycles in faulty folded hypercubes
Information Processing Letters, 2009
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
19th IEEE International Parallel and Distributed Processing Symposium
Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
Theoretical Computer Science, 2019
A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology
Computers, Materials & Continua
Embedding cube-connected cycles graphs into faulty hypercubes
IEEE Transactions on Computers, 1994
Fault-tolerant path embedding in folded hypercubes with both node and edge faults
Theoretical Computer Science, 2013
Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
Discrete Applied Mathematics, 2019
Hamiltonian paths in hypercubes with local traps
Information Sciences, 2017
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters - IPL, 2008
Discrete Applied Mathematics
On the Existence of Disjoint Spanning Paths in Faulty Hypercubes
Journal of Interconnection Networks, 2010
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science, 2013
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
Journal of Parallel and Distributed Computing, 2007
Fault-free Hamiltonian cycles in faulty arrangement graphs
IEEE Transactions on Parallel and Distributed Systems, 1999
Edge-fault-tolerant bipanconnectivity of hypercubes☆
Information Sciences, 2009
Long path and cycle decompositions of even hypercubes
European Journal of Combinatorics
Subcube fault-tolerance in hypercubes
Information Sciences, 2013
Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Partition in Augmented Cubes
2011
On the embedding of edge-disjoint Hamiltonian cycles in transposition networks
2014 International Conference on Information Science, Electronics and Electrical Engineering, 2014
Annals of Hamiltonian-t-laceability Property of Edge Fault Hierarchical Hypercube Network
2016
Electronic Colloquium on Computational Complexity, 2007
Proceedings of the 1993 ACM conference on Computer science - CSC '93, 1993
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science, 2007
Tolerating faults in hypercubes using subcube partitioning
IEEE Transactions on Computers, 1992
Fault-Tolerant Hamiltonicity of Twisted Cubes
Journal of Parallel and Distributed Computing, 2002
Regular connected bipancyclic spanning subgraphs of hypercubes
Computers & Mathematics with Applications, 2011
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations
2009