𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved Algorithms for Maximum Agreement and

✍ Scribed by Viet Tung Hoang; Wing-Kin Sung

Publisher
Springer
Year
2009
Tongue
English
Weight
657 KB
Volume
59
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved bound on the maximum agreeme
An improved bound on the maximum agreement subtree problem
✍ Mike Steel; LΓ‘szlΓ³ A. SzΓ©kely πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 299 KB

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.