✦ LIBER ✦

Efficient algorithms for dilated mappings of binary trees

✍ Scribed by Mohammad Ashraf Iqbal

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 482 KB
Volume: 15
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(92)90060-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A loopless algorithm for generating bina

A loopless algorithm for generating binary tree sequences

✍ D.Roelants van Baronaigien 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 719 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

A New Efficient Algorithm for Embedding

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar

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