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 this page instead for the normal view: Faster algorithms for counting subgraphs in sparse graphs |
scientific article; zbMATH DE number 7374884
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
