The tree inclusion problem

DOI10.1145/1978782.1978793zbMath1295.68170OpenAlexW2150621286WikidataQ60554448 ScholiaQ60554448MaRDI QIDQ3189022

Inge Li Gørtz, Philip Bille

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1978782.1978793

zbMATH Keywords

pattern matchingtree inclusion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (8)

Longest common extensions in trees ⋮ String indexing for top-\(k\) close consecutive occurrences ⋮ Gapped indexing for consecutive occurrences ⋮ Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism ⋮ A top down algorithm for constrained tree inclusion ⋮ Mining rooted ordered trees under subtree homeomorphism ⋮ Unnamed Item ⋮ New and improved algorithms for unordered tree inclusion

This page was built for publication: The tree inclusion problem