Rotation Distance is Fixed-Parameter Tractable
Data Structures and Algorithms
2018-03-19 v1
Abstract
Rotation distance between 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 the case of ordered rooted trees, we show that the rotation distance between two ordered trees is fixed-parameter tractable, in the parameter, k, the rotation distance. The proof relies on the kernalization of the initial trees to trees with size bounded by 7k.
Keywords
Cite
@article{arxiv.0903.0197,
title = {Rotation Distance is Fixed-Parameter Tractable},
author = {Sean Cleary and Katherine St. John},
journal= {arXiv preprint arXiv:0903.0197},
year = {2018}
}
Comments
9 pages, 3 figures