\(k\)-restricted rotation distance between binary trees

DOI10.1016/j.ipl.2006.12.007zbMath1184.68203OpenAlexW1987293329MaRDI QIDQ845999

Fabrizio Luccio, Antonio Mesa Enriquez, Linda Pagli

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.12.007

zbMATH Keywords

binary treedata structuresdesign of algorithmsrotation distance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (5)

Restricted rotation distance between k-ary trees ⋮ Distributions of restricted rotation distances ⋮ Root-restricted Kleenean rotations ⋮ Unnamed Item ⋮ Weak associativity and restricted rotation

Cites Work

• Unnamed Item
• Bounding restricted rotation distance
• An efficient upper bound of the rotation distance of binary trees
• On the upper bound on the rotation distance of binary trees
• Restricted rotation distance between binary trees.
• Rotation Distance, Triangulations, and Hyperbolic Geometry

This page was built for publication: \(k\)-restricted rotation distance between binary trees