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

The Maximum Utilization Subtree Problem

โœ Scribed by James W. George; Charles S. ReVelle; John R. Current

Book ID
110398695
Publisher
Springer US
Year
2002
Tongue
English
Weight
156 KB
Volume
110
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The maximum agreement subtree problem
The maximum agreement subtree problem
โœ Martin, Daniel M.; Thatte, Bhalchandra D. ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 482 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.