Refined upper bounds for right-arm rotation distances

DOI10.1016/j.tcs.2007.02.024zbMath1117.05034OpenAlexW1973471427MaRDI QIDQ884484

Sean Cleary, Fabrizio Luccio, Linda Pagli

Publication date: 6 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.024

zbMATH Keywords

binary treedesign of algorithmsrestricted rotationright arm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Related Items (max. 100)

Restricted rotation distance between k-ary trees ⋮ A metric for rooted trees with unlabeled vertices based on nested parentheses ⋮ Root-restricted Kleenean rotations

Cites Work

• Unnamed Item
• Rotation sequences and edge-colouring of binary tree pairs
• Efficient lower and upper bounds of the diagonal-flip distance between triangulations
• Right-arm rotation distance between binary trees
• Bounding restricted rotation distance
• A note on some tree similarity measures
• On the upper bound on the rotation distance of binary trees
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• BOUNDING RIGHT-ARM ROTATION DISTANCES
• Algorithms and Data Structures

This page was built for publication: Refined upper bounds for right-arm rotation distances