Counting induced subgraphs: an algebraic approach to \#W[1]-hardness (Q5092385)
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: Counting induced subgraphs: an algebraic approach to \#W[1]-hardness |
scientific article; zbMATH DE number 7561670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting induced subgraphs: an algebraic approach to \#W[1]-hardness |
scientific article; zbMATH DE number 7561670 |
Statements
21 July 2022
0 references
counting complexity
0 references
edge-transitive graphs
0 references
graph homomorphisms
0 references
induced subgraphs
0 references
parameterized complexity
0 references
0.9567606449127196
0 references
0.924552083015442
0 references
0.9208999276161194
0 references
0.82502681016922
0 references
0.8194214701652527
0 references
