An efficient upper bound of the rotation distance of binary trees
References (18)
- et al.
A note on some tree similarity measures
Inform. Process. Lett.
(1982) - et al.
On the cell-growth problem for arbitrary polygons
Discrete Math.
(1975) - et al.
On the upper bound on the rotation distance of binary trees
Inform. Process. Lett.
(1989) On the rotation distance in the lattice of binary trees
Inform. Process. Lett.
(1987)Triangulating the circle, at random
Amer. Math. Monthly
(1994)- et al.
Properties of the rotation graph of binary trees
Congr. Numer.
(1995) - et al.
The number of coverings in four Catalan lattices
Internat. J. Comput. Math.
(1996) - et al.
The edge-flipping distance of triangulations
J. Universal Comput. Sci.
(1996) - et al.
Flipping edges in triangulations
Discrete Comput. Geom.
(1999)
There are more references available in the full text version of this article.
Cited by (43)
An improved kernel for the flip distance problem on simple convex polygons
2023, Information Processing LettersFlip distance between two triangulations of a point set is NP-complete
2015, Computational Geometry: Theory and ApplicationsCitation 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 MathematicsMotzkin subposets and Motzkin geodesics in Tamari lattices
2014, Information Processing LettersCitation 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 LettersA metric for rooted trees with unlabeled vertices based on nested parentheses
2010, Theoretical Computer Science
Copyright © 2000 Elsevier Science B.V. All rights reserved.