Lower bounds on the rotation distance of binary trees

Authors:
Fabrizio Luccio;Antonio Mesa Enriquez;Linda Pagli
Affiliations:
Dipartimento di Informatica, Universití di Pisa, Italy;Facultad de Matemítica y Computación, Universidad de la Habana, Cuba;Dipartimento di Informatica, Universití di Pisa, Italy
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 0

On the rotation distance of binary trees

Information Processing Letters
On the upper bound on the rotation distance of binary trees

Information Processing Letters
Efficient lower and upper bounds of the diagonal-flip distance between triangulations

Information Processing Letters
An improved kernel size for rotation distance in binary trees

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The rotation distanced(S,T) between two binary trees S, T of n vertices is the minimum number of rotations to transform S into T. While it is known that d(S,T)==11. We are unable to prove the conjecture, but we give here some simple criteria for lower bound evaluation, leading for example to individuate some ''regular'' tree structures for which d(S,T)=3n/2-O(1), or d(S,T)=5n/3-O(1).