An efficient upper bound of the rotation distance of binary trees

Information Processing Letters

Volumn 73, Issue 3-4, 2000, Pages 87-92

  Pallo, Jean ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

Algorithms; Binary trees; Lattice; Rotation; Triangulation

Indexed keywords

COMPUTATIONAL GEOMETRY; THEOREM PROVING;

BINARY TREES;

TREES (MATHEMATICS);

EID: 0033874956     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(00)00008-9     Document Type: Article

References (18)

1. D. Aldous, Triangulating the circle, at random, Amer. Math. Monthly 101 (1994) 223-233.
2. K. Culik, D. Wood, A note on some tree similarity measures, Inform. Process. Lett. 15 (1982) 39-42.
3. R.D. Dutton, R.O. Rogers, Properties of the rotation graph of binary trees, Congr. Numer. 109 (1995) 51-63.
4. C. Germain, J. Pallo, The number of coverings in four Catalan lattices, Internat. J. Comput. Math. 61 (1996) 19-28.
5. S. Hanke, T. Ottmann, S. Schuierer, The edge-flipping distance of triangulations, J. Universal Comput. Sci. 2 (1996) 570-579.
6. F. Harary, E.M. Palmer, R.C. Read, On the cell-growth problem for arbitrary polygons, Discrete Math. 11 (1975) 371-389.
7. F. Hurtado, M. Noy, J. Urrutia, Flipping edges in triangulations, Discrete Comput. Geom. 22 (1999) 333-346.
8. M. Li, L. Zhang, Better approximation of diagonal-flip transformation and rotation transformation, in: W.L. Hsu (Ed.), Proc. 4th Annual Conf. Computing and Combinatorics, Lecture Notes in Computer Science, Vol. 1449, Springer, Berlin, 1998, pp. 85-94.
9. F. Luccio, L. Pagli, On the upper bound on the rotation distance of binary trees, Inform. Process. Lett. 31 (1989) 57-60.
10. E. Mäkinen, On the rotation distance of binary trees, Inform. Process. Lett. 26 (1987/88) 271-272.
11. J.W. Moon, L. Moser, Triangular dissections of n-gons, Canad. Math. Bull. 6 (1963) 175-178.
12. J. Pallo, Enumerating, ranking and unranking binary trees, Comput. J. 29 (1986) 171-175.
13. J. Pallo, On the rotation distance in the lattice of binary trees, Inform. Process. Lett. 25 (1987) 369-373.
14. F. Ruskey, On the average shape of binary trees, SIAM J. Alg. Disc. Meth. 1 (1980) 43-50.
15. F. Ruskey, T.C. Hu, Generating binary trees lexicographically, SIAM J. Comput. 6 (1977) 745-758.
16. D.D. Sleator, R.E. Tarjan, W.R. Thurston, Rotation distance, in: T.M. Cover, B. Gopinath (Eds.), Open Problems in Communication and Computation, Springer, Berlin, 1987, pp. 130-137.
17. D.D. Sleator, R.E. Tarjan, W.R. Thurston, Rotation distance, triangulations and hyperbolic geometry, J. Amer. Math. Soc. 1 (1988) 647-681.
18. N.J.A. Sloane, S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, New York, 1995.