Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040)
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 7233376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting induced subgraphs: a topological approach to \#W[1]-hardness |
scientific article; zbMATH DE number 7233376 |
Statements
Counting induced subgraphs: a topological approach to \#W[1]-hardness (English)
0 references
12 August 2020
0 references
counting complexity
0 references
Euler characteristic
0 references
homomorphisms
0 references
parameterized complexity
0 references
simplicial complexes
0 references
0 references
0.9984582662582396
0 references
0.9208999276161194
0 references
0.9005175828933716
0 references
0.8166433572769165
0 references
0.8108557462692261
0 references
