Defines rank-bounded rotation distance, reduces general rotation distance to it in polynomial time, and gives O(n^2) algorithm plus quadratic upper bound for skew trees.
Rotation Distance, Triangulations, and Hyperbolic Geometry
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Rotation Distance of Rank Bounded Trees
Defines rank-bounded rotation distance, reduces general rotation distance to it in polynomial time, and gives O(n^2) algorithm plus quadratic upper bound for skew trees.