Computer Science – Data Structures and Algorithms
Scientific paper
2009-03-02
Computer Science
Data Structures and Algorithms
9 pages, 3 figures
Scientific paper
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.
Cleary Sean
John Katherine St.
No associations
LandOfFree
Rotation Distance is Fixed-Parameter Tractable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Rotation Distance is Fixed-Parameter Tractable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rotation Distance is Fixed-Parameter Tractable will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-77503