The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 01:32, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The challenges of unbounded treewidth in parameterised subgraph counting problems |
scientific article |
Statements
The challenges of unbounded treewidth in parameterised subgraph counting problems (English)
0 references
7 December 2015
0 references
parameterised complexity
0 references
counting complexity
0 references
subgraph counting
0 references
FPTRAS
0 references
