20 citations · 75 across the 28 of their papers we have counts for
4 papers · 1 filter
Distributions of restricted rotation distances
Sean Cleary, Haris Nadeem
Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices rep…
An efficient sampling algorithm for difficult tree pairs
Sean Cleary, Roland Maio
It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computin…
Counting difficult tree pairs with respect to the rotation distance problem
Sean Cleary, Roland Maio
Rotation distance between rooted binary trees is the minimum number of simple rotations needed to transform one tree into the other. Computing the rotation distance between a pair…
Rotation Distance is Fixed-Parameter Tractable
Sean Cleary, Katherine St. John
Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing ro…