A linear-time approximation algorithm for rotation distance
From MaRDI portal
Recommendations
Cited in
(19)- Lower bounds on the rotation distance of binary trees
- Linear time algorithms for exact distance transform
- A direct algorithm for restricted rotation distance
- Edge Conflicts do not Determine Geodesics in the Associahedron
- Distributions of restricted rotation distances
- An efficient sampling algorithm for difficult tree pairs
- An efficient algorithm for estimating rotation distance between two binary trees
- Restricted rotation distance between k-ary trees
- On flips in planar matchings
- Flip distances between graph orientations
- Rotation distance for rank bounded trees
- The rotation distance of brooms
- On rotation distance of rank bounded trees
- Shallow-rotation distance via forest representations
- An \(\mathcal{O}(3.82^k)\) time \(\mathsf{FPT}\) algorithm for convex flip distance
- Hardness of finding combinatorial shortest paths on graph associahedra
- An improved kernel size for rotation distance in binary trees
- On the rotation distance between binary trees
- Rotation distance is fixed-parameter tractable
This page was built for publication: A linear-time approximation algorithm for rotation distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075614)
