Login / Signup

An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees.

Zeshan PengHing-Fung Ting
Published in: Inf. Process. Lett. (2006)
Keyphrases
  • binary trees
  • np hard
  • optimal solution
  • objective function
  • search space
  • machine learning
  • similarity measure
  • computational complexity
  • high dimensional
  • memory space
  • space efficient
  • series parallel