On the upper bound on the rotation distance of binary trees
Information Processing Letters
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
Information Processing Letters
| Hi-index | 0.89 |
A Fermat point P is one that minimizes the sum @d of the distances between P and the points of a given set. The resulting arrangement, called here a Fermat star, is a particular Steiner tree with only one intermediate point. We extend these concepts to rooted binary trees under the known rotation distance that measures the difference in shape of such trees. Minimizing @d is hard, due to the intrinsic difficulty of computing the rotation distance. Then we limit our study to establishing significant upper bounds for @d. In particular, for m binary trees of n vertices, we show how to construct efficiently a Fermat star with @d=