| Original language | English (US) |
|---|---|
| Title of host publication | Seventh Annual ACM-SIAM Symposium on Discrete Algorithms |
| Pages | 323-332 |
| State | Published - 1996 |
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 proceeding › Conference contribution