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

A remark on the time complexity of the subtree problem

โœ Scribed by M. Stadel

Publisher
Springer Vienna
Year
1978
Tongue
English
Weight
257 KB
Volume
19
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A remark on the length problem
A remark on the length problem
โœ Jeanleah Mohrherr ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 656 KB
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.