Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies (Q6943516)
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 8079481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies |
scientific article; zbMATH DE number 8079481 |
Statements
Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies (English)
0 references
13 August 2025
0 references
