The maximum clique problem (Q1318271)

From MaRDI portal
Revision as of 19:56, 26 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q90163273, #quickstatements; #temporary_batch_1706294994303)
scientific article
Language Label Description Also known as
English
The maximum clique problem
scientific article

    Statements

    title
    The maximum clique problem (English)
    0 references
    author
    Panos M. Pardalos
    0 references
    Jue Xue
    0 references
    publication date
    27 March 1994
    0 references
    zbMATH Keywords
    graph coloring
    0 references
    NP-hard
    0 references
    survey
    0 references
    maximum clique
    0 references
    exact algorithms
    0 references
    heuristics
    0 references

    Identifiers

    DOI
    10.1007/BF01098364
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    90-02
    0 references
    90C60
    0 references
    zbMATH DE Number
    540126
    0 references
    Wikidata QID
    Q90163273
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1318271&oldid=11909871"
      Powered by MediaWiki