Pages that link to "Item:Q1607028"
From MaRDI portal
The following pages link to An efficient upper bound of the rotation distance of binary trees (Q1607028):
Displaying 24 items.
- The edge rotation graph (Q367068) (← links)
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849) (← links)
- \(k\)-restricted rotation distance between binary trees (Q845999) (← links)
- The phagocyte lattice of Dyck words (Q862973) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- The Fermat star of binary trees (Q987825) (← links)
- Rotation distance is fixed-parameter tractable (Q989526) (← links)
- Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
- Right-arm rotation distance between binary trees (Q1014416) (← links)
- Bounding restricted rotation distance (Q1029025) (← links)
- Lower bounds on the rotation distance of binary trees (Q1675757) (← links)
- Spin network quantum simulator (Q1852589) (← links)
- Restricted rotation distance between binary trees. (Q1853166) (← links)
- A Motzkin filter in the Tamari lattice (Q2342623) (← links)
- Motzkin subposets and Motzkin geodesics in Tamari lattices. (Q2350595) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- The pruning-grafting lattice of binary trees (Q2378517) (← links)
- A direct algorithm for restricted rotation distance (Q2390238) (← links)
- Computing spin networks (Q2484201) (← links)
- BOUNDING RIGHT-ARM ROTATION DISTANCES (Q5297790) (← links)
- An efficient algorithm for estimating rotation distance between two binary trees (Q5312707) (← links)
- Restricted rotation distance between k-ary trees (Q5886032) (← links)
- An improved kernel for the flip distance problem on simple convex polygons (Q6161439) (← links)
