Pages that link to "Item:Q3075614"
From MaRDI portal
The following pages link to A Linear-Time Approximation Algorithm for Rotation Distance (Q3075614):
Displaying 13 items.
- An improved kernel size for rotation distance in binary trees (Q763531) (← links)
- On the rotation distance between binary trees (Q846983) (← links)
- Rotation distance is fixed-parameter tractable (Q989526) (← links)
- Lower bounds on the rotation distance of binary trees (Q1675757) (← links)
- Linear time algorithms for exact distance transform (Q1932832) (← links)
- A direct algorithm for restricted rotation distance (Q2390238) (← links)
- Edge Conflicts do not Determine Geodesics in the Associahedron (Q4638997) (← links)
- Distributions of restricted rotation distances (Q5045245) (← links)
- Restricted rotation distance between k-ary trees (Q5886032) (← links)
- On flips in planar matchings (Q5919054) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- The rotation distance of brooms (Q6201876) (← links)
- On rotation distance of rank bounded trees (Q6593700) (← links)