Embedding mesh of trees in the hypercube
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On embedding binary trees into hypercubes
Journal of Parallel and Distributed Computing
Embedding ladders and caterpillars into the hypercube
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Embedding of k-ary complete trees into hypercubes with uniform load
Journal of Parallel and Distributed Computing
Embedding complete trees into the hypercube
Discrete Applied Mathematics
Efficient embeddings of ternary trees into hypercubes
Journal of Parallel and Distributed Computing
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
On embedding subclasses of height-balanced trees in hypercubes
Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
| Hi-index | 0.00 |
A height-balanced tree is a rooted binary tree T in which for every vertex v@?V(T), the heights of the left and right subtrees of v, differ by at most one. In this paper, we embed two subclasses of height-balanced trees into hypercubes with unit dilation. We also prove that for certain values of p and for all m=1, a complete p^m-ary tree of height h is embeddable into a hypercube of dimension O(mh) with dilation O(m) using the embedding results of the above height-balanced trees. These results improve and extend the results of Gupta et al. (2003) [10].