Original language | English (US) |
---|---|

Title of host publication | Seventh Annual ACM-SIAM Symposium on Discrete Algorithms |

Pages | 323-332 |

State | Published - 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)