| Literature DB >> 20161013 |
Mike Steel1, László A Székely.
Abstract
We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same ≥ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves.Entities:
Year: 2009 PMID： 20161013 PMCID： PMC2758697 DOI： 10.1016/j.aml.2009.06.019
Source DB: PubMed Journal: Appl Math Lett ISSN： 0893-9659 Impact factor: 4.055