The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (original) (raw)
Related papers
On the embedding of edge-disjoint Hamiltonian cycles in transposition networks
2014 International Conference on Information Science, Electronics and Electrical Engineering, 2014
Proceedings of the 1993 ACM conference on Computer science - CSC '93, 1993
Constructing Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Cover in Augmented Cubes
2012
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
19th IEEE International Parallel and Distributed Processing Symposium
The bicube: an interconnection of two hypercubes
International Journal of Computer Mathematics, 2014
Computing Research Repository - CORR, 2010
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Theoretical Computer Science, 2011
On shortest disjoint paths and Hamiltonian cycles in some interconnection networks
2011
Analysis of a Class of Networks Based on Cubic Star Graphs
Journal of Circuits, Systems and Computers, 1994
Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Partition in Augmented Cubes
2011
Vertex-fault-tolerant cycles embedding in balanced hypercubes
Information Sciences, 2014
Parallel algorithms on the rotation-exchange network-a trivalent variant of the star graph
… ' 99. The Seventh Symposium on the, 1999
The Spectral Relation between the Cube-Connected Cycles and the Shuffle-Exchange Network
PARS: Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware, 2012
Embedding cube-connected cycles graphs into faulty hypercubes
IEEE Transactions on Computers, 1994
A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology
Computers, Materials & Continua
Fault-tolerant cycles embedding in hypercubes with faulty edges
Information Sciences, 2014
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
2013
Interal Res journa Managt Sci Tech
Routing Permutations in the Hypercube
Lecture Notes in Computer Science, 1999
Cycles embedding in balanced hypercubes with faulty edges and vertices
Discrete Applied Mathematics, 2018
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
Inf. Process. Lett., 2021
Some Permutation Routing Algorithms for Low-Dimensional Hypercubes
Theoretical Computer Science, 2002
One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals
Theory of Computing Systems, 2001
SIAM Journal on Discrete Mathematics, 2009
Hamiltonicity of hypercubes with a constraint of required and faulty edges
Journal of Combinatorial Optimization, 2007
Transposition Networks as a Class of Fault-Tolerant Robust Networks
IEEE Transactions on Computers, 1996
Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
IEEE Transactions on Parallel and Distributed Systems, 2006
Recursive cubes of rings as models for interconnection networks
Discrete Applied Mathematics, 2017
CYCLE DECOMPOSITIONS OF REGULAR INTERCONNECTION NETWORKS
Hamiltonian cycles in hypercubes with faulty edges
Information Sciences an International Journal, 2014
Routing permutations and 2–1 routing requests in the hypercube
Discrete Applied Mathematics, 2001
Regular connected bipancyclic spanning subgraphs of hypercubes
Computers & Mathematics with Applications, 2011
A Comparative Study of Star Graphs and Rotator Graphs
1994 International Conference on Parallel Processing-Vol 1 (ICPP'94), 1994
Fault Tolerant Ring Embedding in Tetravalent Cayley Network Graphs
1996
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science, 2007