๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Kaikoura tree theorems: Computing the maximum agreement subtree

โœ Scribed by Mike Steel; Tandy Warnow

Book ID
103103475
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
551 KB
Volume
48
Category
Article
ISSN
0020-0190

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.