Rotation distance is fixed-parameter tractable

Authors:
Sean Cleary;Katherine St. John
Affiliations:
Department of Mathematics, City College of New York & the Graduate Center, City University of New York, New York, NY 10031, United States;Department of Mathematics & Computer Science, Lehman College & the Graduate Center, City University of New York, Bronx, NY 10468, United States
Venue:
Information Processing Letters
Year:
2009

Citing 6
Cited 3

Restricted rotation distance between binary trees

Information Processing Letters
Bounding restricted rotation distance

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

Information Processing Letters
Computing the minimum number of hybridization events for a consistent evolutionary history

Discrete Applied Mathematics
Invitation to data reduction and problem kernelization

ACM SIGACT News
The lost continent of polynomial time: preprocessing and kernelization

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation

An improved kernel size for rotation distance in binary trees

Information Processing Letters
A metric for rooted trees with unlabeled vertices based on nested parentheses

Theoretical Computer Science
Flip distance between triangulations of a planar point set is APX-hard

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

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 kernelization of the initial trees to trees with size bounded by 5k.