Pages that link to "Item:Q846983"
From MaRDI portal
The following pages link to On the rotation distance between binary trees (Q846983):
Displaying 21 items.
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- Expected maximum vertex valence in pairs of polygonal triangulations (Q499917) (← links)
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849) (← 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)
- An efficient upper bound of the rotation distance of binary trees (Q1607028) (← links)
- Lower bounds on the rotation distance of binary trees (Q1675757) (← 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)
- Common edges in rooted trees and polygonal triangulations (Q1953425) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- Combinatorial flip actions and Gelfand pairs for affine Weyl groups (Q2153301) (← links)
- Compatibility fans for graphical nested complexes (Q2397100) (← links)
- Extremal distances for subtree transfer operations in binary trees (Q2421307) (← links)
- The diameter of associahedra (Q2450096) (← links)
- THE SUBWORD REVERSING METHOD (Q2996840) (← links)
- (Q4005191) (← links)
- Celebrating Loday's associahedron (Q6139351) (← links)
- On rotation distance of rank bounded trees (Q6593700) (← links)
