The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2015.06.019 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2015.06.019 / rank | |||
Normal rank | |||
Latest revision as of 07:39, 10 December 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
0 references
