Lower bounds on the rotation distance of binary trees.

Fabrizio Luccio Antonio Mesa Enriques Linda Pagli

Published in: Inf. Process. Lett. (2010)

Keyphrases

binary trees
lower bound
upper bound
objective function
series parallel
worst case
distance measure
np hard
branch and bound
distance function
search algorithm
multiresolution
euclidean distance
metric space
binary tree