Pages that link to "Item:Q1029025"
From MaRDI portal
The following pages link to Bounding restricted rotation distance (Q1029025):
Displaying 12 items.
- 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)
- On the rotation distance between binary trees (Q846983) (← links)
- Refined upper bounds for right-arm rotation distances (Q884484) (← links)
- Rotation distance is fixed-parameter tractable (Q989526) (← links)
- Root-restricted Kleenean rotations (Q1944034) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- A direct algorithm for restricted rotation distance (Q2390238) (← links)
- Computing spin networks (Q2484201) (← links)
- Distributions of restricted rotation distances (Q5045245) (← links)
- Restricted rotation distance between k-ary trees (Q5886032) (← links)
