An efficient upper bound of the rotation distance of binary trees

https://doi.org/10.1016/S0020-0190(00)00008-9Get rights and content

Abstract

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.

References (18)

There are more references available in the full text version of this article.

Cited by (43)

  • Flip distance between two triangulations of a point set is NP-complete

    2015, Computational Geometry: Theory and Applications
    Citation Excerpt :

    Attempts have also been made to compute good upper and lower bounds on the flip distance efficiently. See, for example, [3,10,20,22]. The more general problem of computing the flip distance between two triangulations of a point set is stated as an open problem in the survey by Bose and Hurtado [6], the book by Devadoss and O'Rourke [11, Unsolved Problem 12] and the book on triangulations by De Loera et al. [9, Exercise 3.18].

  • A Motzkin filter in the Tamari lattice

    2015, Discrete Mathematics
  • Motzkin subposets and Motzkin geodesics in Tamari lattices

    2014, Information Processing Letters
    Citation Excerpt :

    There remains today an open problem whether the rotation distance can be computed in polynomial time. Previous works on rotation distance have focused on approximation algorithms [4,7,18,19]. In the previous proposition, we use the definition of a graded poset given by Grätzer (see [12], p. 233).

  • Chain rotations: A new look at tree distance

    2013, Information Processing Letters
View all citing articles on Scopus
View full text