Homomorphisms are a good basis for counting small subgraphs (Q4977973)
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: Homomorphisms are a good basis for counting small subgraphs |
scientific article; zbMATH DE number 6761810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Homomorphisms are a good basis for counting small subgraphs |
scientific article; zbMATH DE number 6761810 |
Statements
Homomorphisms are a good basis for counting small subgraphs (English)
0 references
17 August 2017
0 references
counting subgraphs
0 references
exponential-time hypothesis
0 references
fixed-parameter tractability
0 references
homomorphisms
0 references
0.8477375507354736
0 references
0.8327550888061523
0 references
0.8124999403953552
0 references
0.8086695075035095
0 references
0.8049015998840332
0 references
