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

Cole, Richard; Hariharan, Ramesh

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

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

MPS-Authors

/persons/resource/persons44586

Hariharan, Ramesh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Cole, R., & Hariharan, R. (1996). An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. In 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96) (pp. 323-332). New York: acm.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB46-F

Abstract

There is no abstract available