✦ LIBER ✦

Efficient algorithms for tree reconstruction

✍ Scribed by W. Slough; K. Efe

Publisher: Springer Netherlands
Year: 1989
Tongue: English
Weight: 154 KB
Volume: 29
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01952690

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Space Efficient Algorithms for Ordered T

Space Efficient Algorithms for Ordered Tree Comparison

✍ Lusheng Wang; Kaizhong Zhang 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 351 KB

Efficient algorithms for inferring evolu

Efficient algorithms for inferring evolutionary trees

✍ Dan Gusfield 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 547 KB

Efficient algorithms for generalized cut

Efficient algorithms for generalized cut-trees

✍ Dan Gusfield; Dalit Naor 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 872 KB

An optimal algorithm for reconstructing

An optimal algorithm for reconstructing a binary tree

✍ V. Kamakoti; C. Pandu Rangan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 220 KB

More Efficient Algorithm for Ordered Tre

More Efficient Algorithm for Ordered Tree Inclusion

✍ Weimin Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Given two ordered trees S S and T T, the tree inclusion problem is to determine whether it is possible to obtain S S from T T by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for Ž< Ž .< < <. structured text databases. In this paper we prese

Efficient Parallel Algorithms for Graphs

Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

✍ Jens Lagergren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem Ž 3 . Ž. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-Ž 2 . position algorithm is O O n log n . The tree-decomposi