On mapping parallel algorithms into parallel architectures
Journal of Parallel and Distributed Computing
Optimal simulations between mesh-connected arrays of processors
Journal of the ACM (JACM)
Topological Properties of Hypercubes
IEEE Transactions on Computers
On Embedding Rectangular Grids in Hypercubes
IEEE Transactions on Computers
Work-preserving emulations of fixed-connection networks
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Embedding K-ary complete trees into hypercubes
Journal of Parallel and Distributed Computing
Cost Trade-offs in Graph Embeddings, with Applications
Journal of the ACM (JACM)
GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
On the relationship between parallel computation and graph embeddings
On the relationship between parallel computation and graph embeddings
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
Embedding of hypercubes into necklace, windmill and snake graphs
Information Processing Letters
Embedding certain height-balanced trees and complete pm-ary trees into hypercubes
Journal of Discrete Algorithms
| Hi-index | 0.00 |
In this paper we present efficient graph embeddings for complete k-ary trees into boolean hypercubes. In particular, we describe an efficient embedding of a complete ternary tree (k = 3) of height h into a hypercube, which achieves dilation 3 and expansion Θ(1.0104...h). The previously best-known result is dilation 2 and expansion Θ(1.333...h). Our embedding achieves exponentially better expansion at the cost of an increase of 1 in the dilation. We also describe efficient embeddings of k-ary trees into hypercubes when k = 2p * 3q for some p, q 0 such that the embeddings achieve small constant dilation.