✦ LIBER ✦

More Efficient Algorithm for Ordered Tree Inclusion

✍ Scribed by Weimin Chen

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 221 KB
Volume: 26
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1997.0899

No coin nor oath required. For personal study only.

✦ Synopsis

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 present an O lea¨es S S T T time Ž< Ž .< Ž Ž . < Ž .<.. and O lea¨es S S min depth T T , lea¨es T T space algorithm for ordered tree inclusion, by means of a sophisticated bottom-up-matching strategy. Our algor-Ž ithm improves the previous best one Kilpelainen, 1992, Ph.D. thesis, Dept.

📜 SIMILAR VOLUMES

New Algorithm for Ordered Tree-to-Tree C

New Algorithm for Ordered Tree-to-Tree Correction Problem

✍ Weimin Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 179 KB

number of leaves of S and D D denotes the depth of S. The previous best S Ž< < < < Ä 4 Ä 4 . Ž algorithms for this problem run in O S T min L L , D D min L L , D D time K.

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

Efficient basic event ordering schemes f

Efficient basic event ordering schemes for fault tree analysis

✍ L. M. Bartlett; J. D. Andrews 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB

Fault tree analysis is a commonly used means of assessing the system reliability performance in terms of its components' reliability characteristics. More recently, significant advances have been made in methodologies to analyse the fault tree diagram. The most successful of these developments has b

Maximum order tree algorithm for optimal

Maximum order tree algorithm for optimal scheduling of product distribution lines

✍ S. D. Mokashi; A. C. Kokossis 📂 Article 📅 2002 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 235 KB 👁 1 views

H. Almuallim, An efficient algorithm for

H. Almuallim, An efficient algorithm for optimal of decision trees

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 69 KB

Situations in which them is competition among possible contractor agents or possible manager agents are also considered. In all situations we assume that the contractor can choose a level of effort when carrying out the task and we would like the contractor to carry out the task efficiently without

Efficient algorithms for finding the (k,

Efficient algorithms for finding the (k, l)-core of tree networks

✍ Ronald I. Becker; Isabella Lari; Giovanni Storchi; Andrea Scozzari 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB