Recommendations
Cites work
- An efficient upper bound of the rotation distance of binary trees
- An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group
- Combinatorial properties of Thompson’s group 𝐹
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1439421 (Why is no real title available?)
- Introductory notes on Richard Thompson's groups
- Minimal length elements of Thompson's group \(F\)
- Restricted rotation distance between binary trees.
- Rotation Distance, Triangulations, and Hyperbolic Geometry
Cited in
(18)- Lower bounds on the rotation distance of binary trees
- Restricted rotation distance between binary trees.
- Root-restricted Kleenean rotations
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- A direct algorithm for restricted rotation distance
- Computing spin networks
- Effective splaying with restricted rotations
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- Distributions of restricted rotation distances
- BOUNDING RIGHT-ARM ROTATION DISTANCES
- An efficient algorithm for estimating rotation distance between two binary trees
- Algorithms and Data Structures
- Restricted rotation distance between k-ary trees
- 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
- Refined upper bounds for right-arm rotation distances
- Rotation distance is fixed-parameter tractable
This page was built for publication: Bounding restricted rotation distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029025)
