On the rotation distance in the lattice of binary trees
Information Processing Letters
On the upper bound on the rotation distance of binary trees
Information Processing Letters
A shortest path metric on unlabeled binary trees
Pattern Recognition Letters
Restricted rotation distance between binary trees
Information Processing Letters
Right-arm rotation distance between binary trees
Information Processing Letters
Bounding restricted rotation distance
Information Processing Letters
A direct algorithm for restricted rotation distance
Information Processing Letters
k-Restricted rotation with an application to search tree rebalancing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Note: Refined upper bounds for right-arm rotation distances
Theoretical Computer Science
The pruning-grafting lattice of binary trees
Theoretical Computer Science
The Fermat star of binary trees
Information Processing Letters
Rotation distance is fixed-parameter tractable
Information Processing Letters
Lower bounds on the rotation distance of binary trees
Information Processing Letters
A metric for rooted trees with unlabeled vertices based on nested parentheses
Theoretical Computer Science
Chain rotations: A new look at tree distance
Information Processing Letters
Motzkin subposets and Motzkin geodesics in Tamari lattices
Information Processing Letters
| Hi-index | 0.90 |
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.