The Complexity of Near-Optimal Graph Coloring (Q4083458)

From MaRDI portal
Revision as of 18:21, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    author
    Michael R. Garey
    0 references
    David S. Johnson
    0 references
    publication date
    1976
    0 references

    Identifiers

    DOI
    10.1145/321921.321926
    0 references
    zbMATH DE Number
    3503280
    0 references
    Wikidata QID
    Q89895272
    0 references
    OpenAlex ID
    W2025904765
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4083458&oldid=31300787"
    Powered by MediaWiki