A Linear-Time Approximation Algorithm for Rotation Distance

Details A Linear-Time Approximation Algorithm for Rotation Distance A Linear-Time Approximation Algorithm for Rotation Distance

2009-03-02

arxiv.org/abs/0903.0199v2

Computer Science

Data Structures and Algorithms

5 pages, 1 figure

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

A Linear-Time Approximation Algorithm for Rotation Distance 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 A Linear-Time Approximation Algorithm for Rotation Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Linear-Time Approximation Algorithm for Rotation Distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77516