Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism |
scientific article; zbMATH DE number 6082049
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism |
scientific article; zbMATH DE number 6082049 |
Statements
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (English)
0 references
13 September 2012
0 references
tree matching
0 references
bit-parallel algorithms
0 references
unordered trees
0 references
XML queries
0 references
string matching
0 references
0 references
0.993392825126648
0 references
0.9092722535133362
0 references
0.7959920763969421
0 references
0.7934153079986572
0 references
0.7883040904998779
0 references
