Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
From MaRDI portal
Publication:3183485
DOI10.1007/978-3-642-03367-4_48zbMath1253.68110MaRDI QIDQ3183485
Daichi Takenouchi, Hiroaki Yamamoto
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
Related Items
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism, Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism
Cites Work
- Tree pattern matching with a more general notion of occurrence of the pattern.
- Verifying candidate matches in sparse and wildcard matching
- Pattern Matching in Trees
- Faster tree pattern matching
- Tree Pattern Matching to Subset Matching in Linear Time
- Ordered and Unordered Tree Inclusion
- Faster Subtree Isomorphism
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- SOFSEM 2004: Theory and Practice of Computer Science