✦ LIBER ✦

An Analysis of a Good Algorithm for the Subtree Problem, Corrected

✍ Scribed by Verma, Rakesh M.; Reyner, Steven W.

Book ID: 118174170
Publisher: Society for Industrial and Applied Mathematics
Year: 1989
Tongue: English
Weight: 326 KB
Volume: 18
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0218062

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Analysis of a Good Algorithm for the

An Analysis of a Good Algorithm for the Subtree Problem

✍ Reyner, Steven W. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 341 KB

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 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

An approximation algorithm for solving a

An approximation algorithm for solving a problem of cluster analysis

✍ A. V. Dolgushev; A. V. Kel’manov 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 445 KB

A linear time algorithm for finding an o

A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree

✍ K. Viswanathan Iyer; S. Prasanna 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 132 KB

An analysis of the greedy algorithm for

An analysis of the greedy algorithm for the submodular set covering problem

✍ L. A. Wolsey 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 363 KB