An O(n log n) algorithm for the maximum agreement subtree problem for binary trees

Richard Cole, Ramesh Hariharan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationSeventh Annual ACM-SIAM Symposium on Discrete Algorithms
Pages323-332
StatePublished - 1996

Cite this

Cole, R., & Hariharan, R. (1996). An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. In Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 323-332)