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

Zeshan Peng, Hing-Fung Ting. An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees. In Rudolf Fleischer, Gerhard Trippen, editors, Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings. Volume 3341 of Lecture Notes in Computer Science, pages 754-765, Springer, 2004. [doi]

Abstract

Abstract is missing.