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

Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa Przytycka, Mikkel Thorup

Research output: Contribution to journalArticlepeer-review

Fingerprint Dive into the research topics of 'An O(n log n) algorithm for the maximum agreement subtree problem for binary trees'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science