On the complexity of fixed parameter clique and dominating set (Q703534)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of fixed parameter clique and dominating set
scientific article

    Statements

    On the complexity of fixed parameter clique and dominating set (English)
    0 references
    0 references
    0 references
    11 January 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Parameterized algorithms
    0 references
    Clique
    0 references
    Dominating set
    0 references
    Diamonds detection
    0 references
    0 references
    0 references