Parallel dictionaries using AVL trees
Journal of Parallel and Distributed Computing - Parallel and distributed data structures
Journal of Algorithms
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Dense sets and embedding binary trees into hypercubes
Discrete Applied Mathematics
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Node-disjoint paths in hierarchical hypercube networks
Information Sciences: an International Journal
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
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
Solving efficiently the 0-1 multi-objective knapsack problem
Computers and Operations Research
Efficient unbalanced merge-sort
Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Evolutionary design of oriented-tree networks using Cayley-type encodings
Information Sciences: an International Journal
Calibrating embedded protocols on asynchronous systems
Information Sciences: an International Journal
Embedding meshes into twisted-cubes
Information Sciences: an International Journal
Wirelength of hypercubes into certain trees
Discrete Applied Mathematics
An optimal time algorithm for minimum linear arrangement of chord graphs
Information Sciences: an International Journal
Embedding certain height-balanced trees and complete pm-ary trees into hypercubes
Journal of Discrete Algorithms
Hi-index | 0.07 |
A height-balanced tree is a rooted binary tree T in which for every vertex v@?V(T), the heights of the subtrees, rooted at the left and right child of v, differ by at most one; this difference is called the balance factor of v. These trees are extensively used as data structures for sorting and searching. We embed several subclasses of height-balanced trees of height h in Q"h"+"1 under certain conditions. In particular, if a tree T is such that the balance factor of every vertex in the first three levels is arbitrary (0 or 1) and the balance factor of every other vertex is zero, then we prove that T is embeddable in its optimal hypercube with dilation 1 or 2 according to whether it is balanced or not.