#### DMCA

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

### Cached

### Download Links

- [eprints.iisc.ernet.in]
- [eprints.iisc.ernet.in]
- [drona.csa.iisc.ernet.in]
- [ftp.gwdg.de]
- DBLP

### Other Repositories/Bibliography

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

Venue: | SIAM Journal on Computing |

Citations: | 40 - 0 self |