Faster algorithms for finding and counting subgraphs (Q439930): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jcss/FominLRSR12, #quickstatements; #temporary_batch_1736366690727 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcss.2011.10.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2011.10.001 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jcss/FominLRSR12 / rank | |||
Normal rank | |||
Latest revision as of 21:05, 8 January 2025
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
