Rotation distance is fixed-parameter tractable

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 fi...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 109; no. 16; pp. 918 - 922
Main Authors Cleary, Sean, St. John, Katherine
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 31.07.2009
Elsevier
Elsevier Sequoia S.A
Subjects
Algorithmics. Computability. Computer arithmetics
Analysis of algorithms
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computational complexity
Computer science; control theory; systems
Exact sciences and technology
Fixed parameter tractability
Graph theory
Mathematics
Miscellaneous
Optimization algorithms
Parameter optimization
Rotation distance
Sciences and techniques of general use
Studies
Theoretical computing
Analysis of algorithms
Computational complexity
Rotation distance
Fixed parameter tractability
Polynomial
Computer theory
Computing
Rotation
Polynomial time
Information processing
Proof
Distance measurement
Algorithm analysis
Distance
Online AccessGet full text

Cover

More Information
Summary: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 5 k.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2009.04.023