On the upper bound on the rotation distance of binary trees
From MaRDI portal
Publication:1823251
DOI10.1016/0020-0190(89)90069-0zbMath0681.05024OpenAlexW1974505029MaRDI QIDQ1823251
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90069-0
Related Items (15)
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ Efficient lower and upper bounds of the diagonal-flip distance between triangulations ⋮ \(k\)-restricted rotation distance between binary trees ⋮ On the rotation distance between binary trees ⋮ A direct algorithm for restricted rotation distance ⋮ An efficient algorithm for estimating rotation distance between two binary trees ⋮ Unnamed Item ⋮ Lower bounds on the rotation distance of binary trees ⋮ Refined upper bounds for right-arm rotation distances ⋮ A metric for rooted trees with unlabeled vertices based on nested parentheses ⋮ A distance metric on binary trees using lattice-theoretic measures ⋮ The Fermat star of binary trees ⋮ An improved kernel size for rotation distance in binary trees ⋮ Restricted rotation distance between binary trees. ⋮ An efficient upper bound of the rotation distance of binary trees
Cites Work
This page was built for publication: On the upper bound on the rotation distance of binary trees
