Pages that link to "Item:Q1675757"
From MaRDI portal
The following pages link to Lower bounds on the rotation distance of binary trees (Q1675757):
Displaying 14 items.
- On the rotation distance between binary trees (Q846983) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- On the rotation distance of graphs (Q1318800) (← links)
- On the diameter of the rotation graph of binary coupling trees (Q1348109) (← links)
- On the upper bound on the rotation distance of binary trees (Q1823251) (← links)
- The Euclidean distortion of complete binary trees (Q1864125) (← links)
- Chain rotations: a new look at tree distance (Q1943634) (← links)
- Neighborhoods of trees in circular orderings (Q2352433) (← links)
- Extremal distances for subtree transfer operations in binary trees (Q2421307) (← links)
- Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686) (← links)
- On bounds for the rotation distance between binary coupling trees (Q2741329) (← links)
- Lower Bounds for Accessing Binary Search Trees with Rotations (Q3829056) (← links)
- (Q4005191) (← links)
- Flip distances between graph orientations (Q5919075) (← links)