Note: Refined upper bounds for right-arm rotation distances

Authors:
Sean Cleary;Fabrizio Luccio;Linda Pagli
Affiliations:
Department of Mathematics, The City College of New York, NY, United States;Dipartimento di Informatica, Università di Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Italy
Venue:
Theoretical Computer Science
Year:
2007

Citing 7
Cited 3

On the upper bound on the rotation distance of binary trees

Information Processing Letters
Right-arm rotation distance between binary trees

Information Processing Letters
Bounding restricted rotation distance

Information Processing Letters
Rotation sequences and edge-colouring of binary tree pairs

Theoretical Computer Science
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations

Theoretical Computer Science
Efficient lower and upper bounds of the diagonal-flip distance between triangulations

Information Processing Letters
k-Restricted rotation with an application to search tree rebalancing

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

A metric for rooted trees with unlabeled vertices based on nested parentheses

Theoretical Computer Science
Root-restricted Kleenean rotations

Information Processing Letters
Chain rotations: A new look at tree distance

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

Rotation distances measure the difference in shape in rooted binary trees. We construct sharp bounds on maximal right-arm rotation distance and restricted right-arm rotation distance for trees of size n. These bounds sharpen the results of Cleary and Taback and incorporate the lengths of the right side of the trees to improve the bounds.