Faster algorithms for counting subgraphs in sparse graphs (Q2041986)
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 7374884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for counting subgraphs in sparse graphs |
scientific article; zbMATH DE number 7374884 |
Statements
Faster algorithms for counting subgraphs in sparse graphs (English)
0 references
26 July 2021
0 references
subgraph counting
0 references
tree decomposition
0 references
degeneracy
0 references
sparsity
0 references
0.9276825785636902
0 references
0.8124999403953552
0 references
0.8100802898406982
0 references
0.7977814078330994
0 references
0.7881333827972412
0 references
