More Efficient Algorithm for Ordered Tree Inclusion

DOI10.1006/jagm.1997.0899zbMath0894.68109OpenAlexW2025701920MaRDI QIDQ4386453

Wei-Min Chen

Publication date: 19 August 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1997.0899

zbMATH Keywords

query processingtree inclusion problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items

A new tree inclusion algorithm ⋮ On Chen and Chen's new tree inclusion algorithm ⋮ Simulation relations for pattern matching in directed graphs ⋮ A survey on tree matching and XML retrieval ⋮ Fast arc-annotated subsequence matching in linear space ⋮ Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism ⋮ A top down algorithm for constrained tree inclusion ⋮ Finding common structured patterns in linear graphs ⋮ A survey on tree edit distance and related problems ⋮ A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression. ⋮ Constrained tree inclusion