Sciweavers

64
Voted
SODA
1996
ACM
140views Algorithms» more  SODA 1996»
14 years 10 months ago
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
Richard Cole, Ramesh Hariharan