Refined upper bounds for right-arm rotation distances

DOI10.1016/J.TCS.2007.02.024MaRDI QIDQ884484zbMATH OpenOpenAlexFDO

Authors Sean Cleary, Fabrizio Luccio, L. 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) Distance in graphs (05C12) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• BOUNDING RIGHT-ARM ROTATION DISTANCES
• Bounding restricted rotation distance
• Right-arm rotation distance between binary trees
• \(k\)-restricted rotation distance between binary trees
• Restricted rotation distance between binary trees.

Cites work

• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• A note on some tree similarity measures
• Algorithms and Data Structures
• Bounding restricted rotation distance
• BOUNDING RIGHT-ARM ROTATION DISTANCES
• Efficient lower and upper bounds of the diagonal-flip distance between triangulations
• scientific article; zbMATH DE number 2170467 (Why is no real title available?)
• On the upper bound on the rotation distance of binary trees
• Right-arm rotation distance between binary trees
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Rotation sequences and edge-colouring of binary tree pairs

Cited in

(7)

• Right-arm rotation distance between binary trees
• Bounding restricted rotation distance
• Root-restricted Kleenean rotations
• A metric for rooted trees with unlabeled vertices based on nested parentheses
• BOUNDING RIGHT-ARM ROTATION DISTANCES
• Restricted rotation distance between k-ary trees
• On the rotation distance between binary trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884484)