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

Z. S. Peng, H. F. Ting. An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees. Inf. Process. Lett., 100(4):137-144, 2006. [doi]

Abstract

Abstract is missing.