On Hardness of Approximating the Parameterized Clique Problem (Q2800551)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Hardness of Approximating the Parameterized Clique Problem |
scientific article |
Statements
On Hardness of Approximating the Parameterized Clique Problem (English)
0 references
15 April 2016
0 references
clique
0 references
fixed parameter tractability
0 references
hardness of approximation
0 references
parameterized complexity
0 references
