On hardness of approximating the parameterized clique problem (Q2800551)

From MaRDI portal





scientific article; zbMATH DE number 6569684
Language Label Description Also known as
English
On hardness of approximating the parameterized clique problem
scientific article; zbMATH DE number 6569684

    Statements

    0 references
    0 references
    15 April 2016
    0 references
    clique
    0 references
    fixed parameter tractability
    0 references
    hardness of approximation
    0 references
    parameterized complexity
    0 references
    On hardness of approximating the parameterized clique problem (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references