Skip to content

An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.

Richard Cole, Ramesh Hariharan

VenueA*SODA
Year1996
ProceedingsSODA

Browse the full SODA paper archive.