Faster algorithms for finding and counting subgraphs (Q439930): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q60488486, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60488486 / rank | |||
Normal rank | |||
Revision as of 23:23, 6 February 2024
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
