Efficient Pattern Matching on Graph Patterns of Bounded Treewidth (Q2840694): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:21, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Pattern Matching on Graph Patterns of Bounded Treewidth |
scientific article |
Statements
Efficient Pattern Matching on Graph Patterns of Bounded Treewidth (English)
0 references
23 July 2013
0 references
graph pattern
0 references
pattern matching problem
0 references
treewidth
0 references
partial \(k\)-tree
0 references
