Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

SODA
1996
ACM

favoriteEmaildiscussreport

140views Algorithms» more SODA 1996»

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

13 years 5 months ago

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

Download www.hariharan-ramesh.com

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 items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(n log n) time algorithm for this problem.

Richard Cole, Ramesh Hariharan

Real-time Traffic

Agreement Subtree Problem | Algorithms | Largest Subset | SODA 1996 |

claim paper

Related Content

» PolynomialTime Algorithms for the Ordered Maximum Agreement Subtree Problem

» Approximating the Maximum Isomorphic Agreement Subtree Is Hard

» Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions

» Experimental Studies of Symbolic ShortestPath Algorithms

» Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems

» The Checkpoint Problem

» Distributed Operator Placement and Data Caching in LargeScale Sensor Networks

» Decision trees for entity identification approximation algorithms and hardness results

» Efficient Rebalancing of Chromatic Search Trees

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1996
Where	SODA
Authors	Richard Cole, Ramesh Hariharan

Comments (0)