Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness |
scientific article |
Statements
Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (English)
0 references
25 March 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 references
