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; zbMATH DE number 6067699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for finding and counting subgraphs |
scientific article; zbMATH DE number 6067699 |
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
0.8402398824691772
0 references
0.8340780735015869
0 references
0.8333497643470764
0 references
0.8327571749687195
0 references
0.8234066367149353
0 references
