The DADO production system machine
Journal of Parallel and Distributed Computing
Embedding trees in a hypercube is NP-complete
SIAM Journal on Computing
Embedding Rectangular Grids into Square Grids with Dilation Two
IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Efficient embeddings of trees in hypercubes
SIAM Journal on Computing
Embedding grids into hypercubes
Journal of Computer and System Sciences
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Randomized load distribution of arbitrary trees in distributed networks
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
A new Parallel Algorithm for the Parentheses-Matching Problem
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Paths in Möbius cubes and crossed cubes
Information Processing Letters
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
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
Geodesic pancyclicity of crossed cubes
MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
Embedding of meshes in Möbius cubes
Theoretical Computer Science
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Information Processing Letters
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Conditional fault diameter of crossed cubes
Journal of Parallel and Distributed Computing
Constructing the nearly shortest path in crossed cubes
Information Sciences: an International Journal
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
The Journal of Supercomputing
A k-cube graph construction for mappings from binary vectors to permutations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
Information Sciences: an International Journal
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
Edge-pancyclicity of twisted cubes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Embedding a mesh of trees in the crossed cube
Information Processing Letters
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
| Hi-index | 14.98 |
The recently introduced interconnection network, crossed cube, has attracted much attention in the parallel processing area due to its many attractive features. Like the ordinary hypercube, the n-dimensional crossed cube is a regular graph with 2n vertices and n2n驴1 edges. The diameter of the crossed cube is approximately half that of the ordinary hypercube. These advantages of the crossed cube motivated the study of how well it can simulate other networks such as the complete binary tree. In this paper, we show that the (2n驴 1)-node complete binary tree can be embedded into the n-dimensional crossed cube with dilation 1.