Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
From MaRDI portal
Publication:450558
DOI10.1016/J.JDA.2011.12.018zbMATH Open1248.68170OpenAlexW2291432131WikidataQ59278876 ScholiaQ59278876MaRDI QIDQ450558FDOQ450558
Authors: Yusaku Kaneta, Hiroki Arimura, Rajeev Raman 
Publication date: 13 September 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.018
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Generating all combinations and partitions. Fasc. 4: Generating all trees. History of combinatorial generation.
- Conjunctive queries over trees
- A survey on tree edit distance and related problems
- The tree inclusion problem
- Pattern Matching in Trees
- Ordered and Unordered Tree Inclusion
- More Efficient Algorithm for Ordered Tree Inclusion
- New Algorithms for Regular Expression Matching
- A Four Russians algorithm for regular expression pattern matching
- Sorting in linear time?
- Constrained tree inclusion
- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
- Functions realizable with word-parallel logical and two's-complement addition instructions
Cited In (3)
Uses Software
This page was built for publication: Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450558)
