Restricted rotation distance between binary trees

Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rotations used to transform the trees are allowed to be only of two types. Restricted rotation distance is larger than rotation distance, since there are only two permissible locations to rotate, but is much easier to compute and estimate. We obtain linear upper and lower bounds for restricted rotation distance in terms of the number of interior nodes in the trees. Further, we describe a linear-time algorithm for estimating the restricted rotation distance between two trees and for finding a sequence of rotations which realizes that estimate. The methods use the metric properties of the abstract group known as Thompson's group F.

[1]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[2]  Ronald D. Dutton,et al.  Finding paths in the rotation graph of binary trees , 1996 .

[3]  S. Cleary,et al.  Metrics and embeddings of generalizations of Thompson’s group $F$ , 1998, math/9809185.

[4]  Erkki Mäkinen On the Rotation Distance of Binary Trees , 1988, Inf. Process. Lett..

[5]  Jean Marcel Pallo,et al.  A shortest path metric on unlabeled binary trees , 1992, Pattern Recognit. Lett..

[6]  Fabrizio Luccio,et al.  On the Upper Bound on the Rotation Distance of Binary Trees , 1989, Inf. Process. Lett..

[7]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[8]  Jean Marcel Pallo,et al.  An efficient upper bound of the rotation distance of binary trees , 2000, Inf. Process. Lett..

[9]  Ronald C. Read,et al.  Graph theory and computing , 1972 .

[10]  Jean Marcel Pallo,et al.  On the Rotation Distance in the Lattice of Binary Trees , 1987, Inf. Process. Lett..

[11]  Kenneth S. Brown,et al.  The Geometry of Rewriting Systems: A Proof of the Anick-Groves-Squier Theorem , 1992 .

[12]  R. Tarjan,et al.  Rotation distance, triangulations, and hyperbolic geometry , 1986, STOC '86.

[13]  Quasi-Isometrically Embedded Subgroups of Thompson's GroupF , 1998, math/9802095.

[14]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[15]  Derick Wood,et al.  A Note on Some Tree Similarity Measures , 1982, Inf. Process. Lett..

[16]  Ross Geoghegan,et al.  An infinite-dimensional torsion-freeFP∞ group , 1984 .

[17]  Thomas Ottmann,et al.  The Edge-flipping Distance of Triangulations , 1996, J. Univers. Comput. Sci..