3 citations · 3 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
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…
cs.DS2020
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…