On Hardness of Approximating the Parameterized Clique Problem (Q2800551): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 09:34, 5 March 2024

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
    0 references
    0 references
    15 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    clique
    0 references
    fixed parameter tractability
    0 references
    hardness of approximation
    0 references
    parameterized complexity
    0 references