On the rotation distance between binary trees

From MaRDI portal
Publication:846983




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)).



Cites work


Cited in
(27)






This page was built for publication: On the rotation distance between binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846983)