Right-arm rotation distance between binary trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1439421 (Why is no real title available?)
- An efficient upper bound of the rotation distance of binary trees
- Enumerating, Ranking and Unranking Binary Trees
- Lower Bounds for Accessing Binary Search Trees with Rotations
- Metrics on partially ordered sets - a survey
- On the deque conjecture for the splay algorithm
- On the use of ordered sets in problems of comparison and consensus of classifications
- Relaxed balance using standard rotations
- Restricted rotation distance between binary trees.
- The rotation \(\chi\)-lattice of ternary trees
Cited in
(27)- An efficient sampling algorithm for difficult tree pairs
- The pruning-grafting lattice of binary trees
- Weak associativity and restricted rotation
- BOUNDING RIGHT-ARM ROTATION DISTANCES
- An efficient algorithm for estimating rotation distance between two binary trees
- Motzkin subposets and Motzkin geodesics in Tamari lattices.
- The combinatorics of a tree-like functional equation for connected chord diagrams
- scientific article; zbMATH DE number 7527483 (Why is no real title available?)
- An efficient upper bound of the rotation distance of binary trees
- Some properties of a new partial order on Dyck paths
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations
- On the rotation distance between binary trees
- Computing spin networks
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- The phagocyte lattice of Dyck words
- A linear-time approximation algorithm for rotation distance
- Recursive constructions for the higher Stasheff-Tamari orders in dimension three using the outer Tamari and Tamari block posets
- Root-restricted Kleenean rotations
- A direct algorithm for restricted rotation distance
- Refined upper bounds for right-arm rotation distances
- Catalan intervals and uniquely sorted permutations
- On a subposet of the Tamari lattice
- Effective splaying with restricted rotations
- Rotational tree structures on binary trees and triangulations
- Chain rotations: a new look at tree distance
- Uniquely sorted permutations
- Restricted rotation distance between k-ary trees
This page was built for publication: Right-arm rotation distance between binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014416)
