๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Space Efficient Algorithms for Ordered Tree Comparison

โœ Scribed by Lusheng Wang; Kaizhong Zhang

Publisher
Springer
Year
2008
Tongue
English
Weight
351 KB
Volume
51
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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