In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small di
The geometry and dynamics of binary trees
β Scribed by T. David; Thomas van Kempen; Huaxiong Huang; Phillip Wilson
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 703 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf
We consider a continuous space which models the set of all phylogenetic trees having a fixed set of leaves. This space has a natural metric of nonpositive curvature, giving a way of measuring distance between phylogenetic trees and providing some procedures for averaging or combining several trees w
Let k be a field and let S n be the symmetric group. The group algebra k[S n ] contains the Solomon descent algebra, which is of dimension 2 n&1 . In [MR] Malvenuto and Reutenauer construct a graded Hopf algebra structure on so that the sum of the Solomon descent algebras There is a basis In betw