de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44586

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/11858/00-001M-0000-0014-AB46-F
Abstract
There is no abstract available