English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

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;

/persons/resource/persons45619

Thorup,  Mikkel
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., Farach-Colton, M., Hariharan, R., Przytycka, T., & Thorup, M. (2000). An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing, 30(5), 1385-1404. Retrieved from http://epubs.siam.org/sam-bin/getfile/SICOMP/articles/31347.pdf.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3378-E
Abstract
There is no abstract available