Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees

DOI10.1007/978-3-642-03367-4_48MaRDI QIDQ3183485zbMATH OpenOpenAlexFDO

Authors Hiroaki Yamamoto, Daichi Takenouchi

Publication date 20 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10091/13658

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• An efficient algorithm for some tree matching problems
• Constrained tree inclusion
• Ordered and Unordered Tree Inclusion

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Faster Subtree Isomorphism
• Faster tree pattern matching
• Ordered and Unordered Tree Inclusion
• Pattern Matching in Trees
• SOFSEM 2004: Theory and Practice of Computer Science
• Tree Pattern Matching to Subset Matching in Linear Time
• Tree pattern matching with a more general notion of occurrence of the pattern.
• Verifying candidate matches in sparse and wildcard matching

Cited in

(7)

• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
• scientific article; zbMATH DE number 4133492 (Why is no real title available?)
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Parallel tree pattern matching
• Bottom-up subtree isomorphism for unordered labeled trees
• scientific article; zbMATH DE number 1839455 (Why is no real title available?)

This page was built for publication: Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183485)