On the rotation distance between binary trees
Combinatorics
2009-01-19 v1
Abstract
We develop combinatorial methods for computing the rotation distance between binary trees, i.e., equivalently, the flip distance between triangulations of a polygon. As an application, we prove that, for each n, there exist size n trees at distance 2n - O(sqrt(n)).
Keywords
Cite
@article{arxiv.0901.2557,
title = {On the rotation distance between binary trees},
author = {Patrick Dehornoy},
journal= {arXiv preprint arXiv:0901.2557},
year = {2009}
}