An efficient upper bound of the rotation distance of binary trees
type: Item
instance of: scholarly article
title: An efficient upper bound of the rotation distance of binary trees
zbMATH Open document ID: 1014.68112
DOI: 10.1016/S0020-0190(00)00008-9
author: R. Smith
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1771744
zbMATH Keywords: polynomial time algorithm
Wikidata QID: Q60692073
describes a project that uses: OEIS
MaRDI profile type: Publication
cites work: Triangulating the Circle, at Random
cites work: A note on some tree similarity measures
cites work: Q3838181
cites work: The number of coverings in four catalan lattices
cites work: Q4942049
cites work: On the cell-growth problem for arbitrary polygons
cites work: Flipping edges in triangulations
cites work: Q4218410
cites work: On the upper bound on the rotation distance of binary trees
cites work: Triangular Dissections of N-Gons
cites work: Enumerating, Ranking and Unranking Binary Trees
cites work: On the Average Shape of Binary Trees
cites work: Generating Binary Trees Lexicographically
cites work: Q3765218
cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry
cites work: Q4834167
description: scientific article; zbMATH DE number 1771744