A Linear-Time Approximation Algorithm for Rotation Distance
Data Structures and Algorithms
2018-03-19 v2
Abstract
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. We give an efficient, linear-time approximation algorithm, which estimates the rotation distance, within a provable factor of 2, between ordered rooted binary trees. .
Cite
@article{arxiv.0903.0199,
title = {A Linear-Time Approximation Algorithm for Rotation Distance},
author = {Sean Cleary and Katherine St. John},
journal= {arXiv preprint arXiv:0903.0199},
year = {2018}
}
Comments
5 pages, 1 figure