Pages that link to "Item:Q1166933"
From MaRDI portal
The following pages link to A note on some tree similarity measures (Q1166933):
Displaying 32 items.
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- Discriminative measures for comparison of phylogenetic trees (Q516872) (← links)
- Rotation sequences and edge-colouring of binary tree pairs (Q703564) (← links)
- 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)
- Refined upper bounds for right-arm rotation distances (Q884484) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Rotation distance is fixed-parameter tractable (Q989526) (← links)
- A computationally efficient approximation to the nearest neighbor interchange metric (Q1057598) (← links)
- Sequential access in splay trees takes linear time (Q1072706) (← links)
- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete (Q1077168) (← links)
- On the deque conjecture for the splay algorithm (Q1193537) (← 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)
- Restricted rotation distance between binary trees. (Q1853166) (← links)
- Flipping in spirals (Q1984590) (← links)
- Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon (Q2223634) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- A direct algorithm for restricted rotation distance (Q2390238) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- The cost of offline binary search tree algorithms and the complexity of the request sequence (Q2481968) (← links)
- Computing spin networks (Q2484201) (← links)
- (Q2741329) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
- Rotation Distance, Triangulations, and Hyperbolic Geometry (Q3799259) (← links)
- Distributions of restricted rotation distances (Q5045245) (← links)
- Average-case analysis via incompressibility (Q5055919) (← links)
- Restricted rotation distance between k-ary trees (Q5886032) (← links)
- An improved kernel for the flip distance problem on simple convex polygons (Q6161439) (← links)
- The rotation distance of brooms (Q6201876) (← links)
