Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Hamilton-connectivity and cycle-embedding of the Möbius cubes
Information Processing Letters
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
IEEE Transactions on Computers
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
Information Sciences—Informatics and Computer Science: An International Journal
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
SIAM Journal on Computing
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
On the bipanpositionable bipanconnectedness of hypercubes
Theoretical Computer Science
Fault-tolerant mapping of a mesh network in a flexible hypercube
WSEAS Transactions on Computers
The panpositionable panconnectedness of augmented cubes
Information Sciences: an International Journal
Embedding meshes into locally twisted cubes
Information Sciences: an International Journal
Embedding of tori and grids into twisted cubes
Theoretical Computer Science
Fault-tolerant meshes and tori embedded in a faulty supercube
WSEAS Transactions on Computers
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
Information Sciences: an International Journal
Embedding multi-dimensional meshes into twisted cubes
Computers and Electrical Engineering
A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
Theoretical Computer Science
Embedding meshes into twisted-cubes
Information Sciences: an International Journal
Embedding of hypercubes into necklace, windmill and snake graphs
Information Processing Letters
| Hi-index | 5.23 |
The hypercube is one of the most popular interconnection networks since it has simple structure and is easy to implement. Mobius cubes form a class of hypercube variants that give better performance with the same number of edges and vertices. In this paper, we consider embedding of meshes in Mobius cubes. The main results obtained in this paper are: (1) For n=1, there exists a 2x2^n^-^1 mesh that can be embedded in the n-dimensional Mobius cube with dilation 1 and expansion 1. (2) For n=4, there exists a 4x2^n^-^2 mesh that can be embedded in the n-dimensional Mobius cube with dilation 2 and expansion 1. (3) For n=4, there are two disjoint 4x2^n^-^3 meshes that can be embedded in the 0-type n-dimensional Mobius cube with dilation 1. (4) For n=4, there are two disjoint 4x2^n^-^3 meshes that can be embedded in the 1-type n-dimensional Mobius cube with dilation 2. Results of (1) and (3) are optimal in the sense that the dilations of the embeddings are 1.