The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601)
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 challenges of unbounded treewidth in parameterised subgraph counting problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8113306760787964
0 references
0.8105779886245728
0 references
0.7882764339447021
0 references
0.7744297981262207
0 references
