Pages that link to "Item:Q5312707"
From MaRDI portal
The following pages link to An efficient algorithm for estimating rotation distance between two binary trees (Q5312707):
Displayed 5 items.
- An improved kernel size for rotation distance in binary trees (Q763531) (← links)
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849) (← links)
- Lower bounds on the rotation distance of binary trees (Q1675757) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- Effective splaying with restricted rotations (Q3506250) (← links)