The Complexity of Near-Optimal Graph Coloring (Q4083458)

From MaRDI portal
Revision as of 09:50, 9 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q89895272, #quickstatements; #temporary_batch_1704785786528)
scientific article; zbMATH DE number 3503280
Language Label Description Also known as
English
The Complexity of Near-Optimal Graph Coloring
scientific article; zbMATH DE number 3503280

    Statements

    title
    The Complexity of Near-Optimal Graph Coloring (English)
    0 references
    DOI
    10.1145/321921.321926
    0 references
    author
    Michael R. Garey
    0 references
    David S. Johnson
    0 references
    publication date
    1976
    0 references
    zbMATH DE Number
    3503280
    0 references
    Wikidata QID
    Q89895272
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4083458&oldid=11830705"
      Powered by MediaWiki