Approximating Maximum Clique by Removing Subgraphs (Q4652632)

From MaRDI portal
Revision as of 05:08, 2 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2139174
Language Label Description Also known as
English
Approximating Maximum Clique by Removing Subgraphs
scientific article; zbMATH DE number 2139174

    Statements

    Approximating Maximum Clique by Removing Subgraphs (English)
    0 references
    0 references
    28 February 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    independent set
    0 references