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 this page instead for the normal view: Efficient pattern matching on graph patterns of bounded treewidth |
scientific article; zbMATH DE number 6190229
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
