A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Linear-Time Approximation Algorithm for Rotation Distance
2010
Journal of Graph Algorithms and Applications
Rotation distance between rooted binary trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In this short note, we give an efficient, linear-time approximation algorithm, which estimates the rotation distance, within a provable factor of 2, between ordered rooted binary trees.
doi:10.7155/jgaa.00212
fatcat:zuttie5y3fh73aqutlw3zer4mm