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)**An O(n log n) algorithm for the maximum agreement subtree problem for binary trees.** / Cole, Richard; Hariharan, Ramesh.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.Cole R, Hariharan R. An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. In Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. 1996. p. 323-332

@inproceedings{780b3ceaf4404010956ec75e7208b13e,

title = "An O(n log n) algorithm for the maximum agreement subtree problem for binary trees",

author = "Richard Cole and Ramesh Hariharan",

year = "1996",

language = "English (US)",

pages = "323--332",

booktitle = "Seventh Annual ACM-SIAM Symposium on Discrete Algorithms",

}

TY - GEN

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

AU - Cole, Richard

AU - Hariharan, Ramesh

PY - 1996

Y1 - 1996

M3 - Conference contribution

SP - 323

EP - 332

BT - Seventh Annual ACM-SIAM Symposium on Discrete Algorithms

ER -