Login / Signup

An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees.

Zeshan PengHing-Fung Ting
Published in: ISAAC (2004)
Keyphrases
  • binary trees
  • worst case
  • computational complexity
  • optimal solution
  • objective function
  • lower bound
  • similarity measure
  • search space
  • multiresolution
  • tree structure
  • memory space
  • binary tree