Pages that link to "Item:Q2390238"
From MaRDI portal
The following pages link to A direct algorithm for restricted rotation distance (Q2390238):
Displaying 8 items.
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849) (← links)
- A direct solution for pairwise rotations in Kaiser's varimax method (Q1081249) (← 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)
- Effective splaying with restricted rotations (Q3506250) (← links)
- THE JANUS TEST: A HIERARCHICAL ALGORITHM FOR COMPUTING DIRECTION AND DISTANCE VECTORS (EXTENDED VERSION)* (Q4366894) (← links)
- Distributions of restricted rotation distances (Q5045245) (← links)
- An efficient algorithm for estimating rotation distance between two binary trees (Q5312707) (← links)