AbstractThe locally twisted cube is a newly introduced interconnection network for parallel computing. Ring embedding is an important issue for evaluating the performance of an interconnection network. In this paper, we investigate the problem of embedding rings into a locally twisted cube. Our main contribution is to find that, for each integer l ε {4, 5,… 2n}, a ring of length l can be embedded into an n-dimensional locally twisted cube so that both the dilation and the load factor are one. As a result, a locally twisted cube is Hamiltonian. We conclude that a locally twisted cube is superior to a hypercube in terms of ring embedding capability
AbstractThe hypercube is one of the most popular interconnection networks since it has a simple stru...
[[abstract]]It is well known that the general problem of finding a Hamilton cycle (ring) in an arbit...
An interconnection network with n nodes is four-pancyclic if it contains a cycle of length l for eac...
AbstractThe locally twisted cube is a newly introduced interconnection network for parallel computin...
Abstract The locally twisted cube LTQn is a newly introduced inter-connection network for parallel c...
AbstractThe n-dimensional hypercube network Qn is one of the most popular interconnection networks s...
www.elsevier.com/locate/aml The locally twisted cube LTQ n which is a newly introduced interconnecti...
The hypercube is emerging as one of the most effective and popular network architectures for large s...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
This paper introduces a new variant of the popular n-dimensional hypercube network Q(n), known as th...
AbstractThis paper addresses how to embed a multi-dimensional torus of maximal size of into an n-dim...
The twisted cube is an important variant of the most popular hypercube network for parallel processi...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
AbstractThe hypercube is one of the most popular interconnection networks since it has a simple stru...
[[abstract]]It is well known that the general problem of finding a Hamilton cycle (ring) in an arbit...
An interconnection network with n nodes is four-pancyclic if it contains a cycle of length l for eac...
AbstractThe locally twisted cube is a newly introduced interconnection network for parallel computin...
Abstract The locally twisted cube LTQn is a newly introduced inter-connection network for parallel c...
AbstractThe n-dimensional hypercube network Qn is one of the most popular interconnection networks s...
www.elsevier.com/locate/aml The locally twisted cube LTQ n which is a newly introduced interconnecti...
The hypercube is emerging as one of the most effective and popular network architectures for large s...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
This paper introduces a new variant of the popular n-dimensional hypercube network Q(n), known as th...
AbstractThis paper addresses how to embed a multi-dimensional torus of maximal size of into an n-dim...
The twisted cube is an important variant of the most popular hypercube network for parallel processi...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
AbstractThe hypercube is one of the most popular interconnection networks since it has a simple stru...
[[abstract]]It is well known that the general problem of finding a Hamilton cycle (ring) in an arbit...
An interconnection network with n nodes is four-pancyclic if it contains a cycle of length l for eac...