Embedding meshes in Boolean cubes by graph decomposition
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
The Stanford Dash Multiprocessor
Computer
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Cycle Embedding on Twisted Cubes
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
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-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
Embedding of meshes in Möbius cubes
Theoretical Computer Science
A note on cycle embedding in folded hypercubes with faulty elements
Information Processing Letters
Embedding a family of meshes into twisted cubes
Information Processing Letters
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
On embedding subclasses of height-balanced trees in hypercubes
Information Sciences: an International Journal
Embedding meshes into locally twisted cubes
Information Sciences: an International Journal
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences: an International Journal
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
An optimal time algorithm for minimum linear arrangement of chord graphs
Information Sciences: an International Journal
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
Hi-index | 0.07 |
The n-dimensional twisted-cube, TN"n, is a variation of the hypercube. In this paper, we study embedding of meshes into TN"n. We prove three major results in this paper: (1) For any integer n=1, a 2x2^n^-^1 mesh can be embedded into TN"n with dilation 1 and expansion 1. (2) For any integer n=4, an mxk(m=3,k=3) mesh cannot be embedded into TN"n with dilation 1. (3) For any integer n=4, two node-disjoint 4x2^n^-^3 meshes can be embedded into TN"n with dilation 2 and expansion 1.