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

Zeshan Peng, Hing-Fung Ting

Browse the full ISAAC paper archive.