Luccio, Fabrizio and Mesa Enriquez, Antonio and Pagli, Linda (2010) Lower Bounds on the Rotation Distance of Binary Trees. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
Other (GZip) Available under License Creative Commons Attribution No Derivatives. Download (160Kb) |
Official URL: http://compass2.di.unipi.it/TR/Files/TR-10-01.pdf....
Abstract
The rotation distance d(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) <= 2n-6, a well known conjecture states that there are trees for which this bound is sharp for any value of n >= 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).
Item Type: | Book |
---|---|
Uncontrolled Keywords: | Rotation distance, Lower bound, Binary tree, Design of algorithms. |
Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | dott.ssa Sandra Faita |
Date Deposited: | 04 Dec 2014 14:34 |
Last Modified: | 04 Dec 2014 14:34 |
URI: | http://eprints.adm.unipi.it/id/eprint/2245 |
Repository staff only actions
View Item |