The complexity of pattern counting in directed graphs, parameterised by the outdegree (Q6499249)
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: The complexity of pattern counting in directed graphs, parameterised by the outdegree |
scientific article; zbMATH DE number 7844611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of pattern counting in directed graphs, parameterised by the outdegree |
scientific article; zbMATH DE number 7844611 |
Statements
The complexity of pattern counting in directed graphs, parameterised by the outdegree (English)
0 references
8 May 2024
0 references
directed graph counting
0 references
graph motifs
0 references
induced subgraph counting
0 references
parameterized complexity
0 references
pattern counting
0 references
subgraph counting
0 references
0 references
