An efficient upper bound of the rotation distance of binary trees

14 years 5 months ago

Download www.cs.cmu.edu

A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.

Jean Marcel Pallo

Real-time Traffic

Convex Polygons Triangulations | IPL 2000 | Polynomial Time Algorithm | Rotation Distance |

claim paper

» Bounding RightArm Rotation Distances

» Efficient Reorganization of Binary Search Trees

» Inorder traversal of splay trees

» A Tight Lower Bound for the Steiner Point Removal Problem on Trees

» Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions

» TS2tree an efficient similarity based organization for trajectory data

» Efficient Rebalancing of Chromatic Search Trees

» Segmentation Based Recovery of Arbitrarily Warped Document Images

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	IPL
Authors	Jean Marcel Pallo

Comments (0)

Sciweavers

An efficient upper bound of the rotation distance of binary trees

Convex Polygons Triangulations | IPL 2000 | Polynomial Time Algorithm | Rotation Distance |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers