Approximating Maximum Clique by Removing Subgraphs (Q4652632)

From MaRDI portal
Revision as of 15:59, 27 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56210406, #quickstatements; #temporary_batch_1706366595684)
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

    title
    Approximating Maximum Clique by Removing Subgraphs (English)
    0 references
    author
    Uriel Feige
    0 references
    publication date
    28 February 2005
    0 references
    zbMATH Keywords
    approximation algorithm
    0 references
    independent set
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C69
    0 references
    05C85
    0 references
    68W25
    0 references
    zbMATH DE Number
    2139174
    0 references
    Wikidata QID
    Q56210406
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4652632&oldid=11923313"
      Powered by MediaWiki