Counting induced subgraphs: an algebraic approach to \#W[1]-hardness (Q832520)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7498364
| 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 7498364 |
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
0.9567606449127196
0 references
0.9069880247116088
0 references
0.9005175828933716
0 references
0.8582072854042053
0 references
0.8368103504180908
0 references
