✦ LIBER ✦

The maximum agreement subtree problem

✍ Scribed by Martin, Daniel M.; Thatte, Bhalchandra D.

Book ID: 122558504
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 482 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.02.037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for the maximum ag

An improved algorithm for the maximum agreement subtree problem

✍ Chuan-Min Lee; Ling-Ju Hung; Maw-Shang Chang; Chia-Ben Shen; Chuan-Yi Tang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 107 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.

An O ( n log n ) Algorithm for the Maxim

An O ( n log n ) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

✍ Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thor 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 238 KB

Polynomial-Time Algorithms for the Order

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

✍ Anders Dessmark; Jesper Jansson; Andrzej Lingas; Eva-Marta Lundell 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 230 KB

The Maximum Utilization Subtree Problem

✍ James W. George; Charles S. ReVelle; John R. Current 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 156 KB

Kaikoura tree theorems: Computing the ma

Kaikoura tree theorems: Computing the maximum agreement subtree

✍ Mike Steel; Tandy Warnow 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 551 KB