Pages that link to "Item:Q1014416"
From MaRDI portal
The following pages link to Right-arm rotation distance between binary trees (Q1014416):
Displaying 21 items.
- On a subposet of the Tamari lattice (Q466873) (← links)
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849) (← links)
- The phagocyte lattice of Dyck words (Q862973) (← links)
- Refined upper bounds for right-arm rotation distances (Q884484) (← links)
- Weak associativity and restricted rotation (Q987810) (← links)
- Root-restricted Kleenean rotations (Q1944034) (← links)
- Some properties of a new partial order on Dyck paths (Q1985358) (← links)
- Catalan intervals and uniquely sorted permutations (Q2174949) (← links)
- Uniquely sorted permutations (Q2199834) (← 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)
- Effective splaying with restricted rotations (Q3506250) (← links)
- (Q5076252) (← 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)
- Recursive constructions for the higher Stasheff-Tamari orders in dimension three using the outer Tamari and Tamari block posets (Q6136670) (← links)
- The combinatorics of a tree-like functional equation for connected chord diagrams (Q6204690) (← links)
