On the rotation distance between binary trees
classification
🧮 math.CO
keywords
distancetreesbinaryrotationapplicationcombinatorialcomputingdevelop
read the original 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)).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.