Efficient pattern matching on graph patterns of bounded treewidth (Q2840694)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6190229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient pattern matching on graph patterns of bounded treewidth |
scientific article; zbMATH DE number 6190229 |
Statements
23 July 2013
0 references
graph pattern
0 references
pattern matching problem
0 references
treewidth
0 references
partial \(k\)-tree
0 references
Efficient pattern matching on graph patterns of bounded treewidth (English)
0 references
0.8168387413024902
0 references
0.8053862452507019
0 references
0.7761045098304749
0 references
0.7591402530670166
0 references
0.7574241161346436
0 references
