An improved bound on the Maximum Agreement Subtree problem

Simple item page
dc.creatorSzekely, Laszlo
dc.creatorSteel, Mike
dc.date2009-03-19
dc.date.accessioned2026-07-07T12:54:18Z
dc.date.available2026-07-07T12:54:18Z
dc.descriptionWe 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 $\geq c\log\log n$ leaves which are homeomorphic, such that homeomorphism is identity on the leaves.
dc.description5 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0903.3386
dc.identifierhttp://arxiv.org/abs/0903.3386
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223883
dc.subjectPopulations and Evolution
dc.subjectQuantitative Methods
dc.titleAn improved bound on the Maximum Agreement Subtree problem
dc.typetext

Files

Collections

arXiv