Lower bounds on the rotation distance of binary trees
type: Item
instance of: scholarly article
title: Lower bounds on the rotation distance of binary trees
zbMATH Open document ID: 1379.05026
author: Fabrizio Luccio
author: Antonio Mesa Enríquez
author: L. Pagli
published in: Information Processing Letters
publication date: 2017-11-03T00:00:00Z
full work available at URL: TR-10-01.pdf.gz
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6802635
zbMATH Keywords: rotation distance
zbMATH Keywords: lower bound
zbMATH Keywords: binary tree
zbMATH Keywords: design of algorithms
MaRDI profile type: Publication
OpenAlex ID: W1990400455
cites work: Efficient lower and upper bounds of the diagonal-flip distance between triangulations
cites work: An efficient algorithm for estimating rotation distance between two binary trees
cites work: A Linear-Time Approximation Algorithm for Rotation Distance
cites work: A note on some tree similarity measures
cites work: On the rotation distance between binary trees
cites work: An improved kernel size for rotation distance in binary trees
cites work: On the upper bound on the rotation distance of binary trees
cites work: An efficient upper bound of the rotation distance of binary trees
cites work: Q4949795
cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry
DOI: 10.1016/J.IPL.2010.07.025
description: scientific article; zbMATH DE number 6802635