Faster algorithms for finding and counting subgraphs (Q439930)
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 algorithms for finding and counting subgraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithms for finding and counting subgraphs |
scientific article |
Statements
Faster algorithms for finding and counting subgraphs (English)
0 references
17 August 2012
0 references
parameterized complexity
0 references
subgraph isomorphism
0 references
homomorphism
0 references
counting
0 references
treewidth
0 references
0 references
