Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q3000495)
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 5897200
| 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 5897200 |
Statements
Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism (English)
0 references
19 May 2011
0 references
0.993392825126648
0 references
0.905197024345398
0 references
0.8015605211257935
0 references
0.7986949682235718
0 references
0.795950710773468
0 references
