Complexity of Coloring Random Graphs (Q4577957)

From MaRDI portal
Revision as of 03:03, 4 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q130112805, #quickstatements; #temporary_batch_1725411297270)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6913944
Language Label Description Also known as
English
Complexity of Coloring Random Graphs
scientific article; zbMATH DE number 6913944

    Statements

    title
    Complexity of Coloring Random Graphs (English)
    0 references
    DOI
    10.1145/3183350
    0 references
    publication date
    6 August 2018
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C15
    0 references
    05C80
    0 references
    zbMATH DE Number
    6913944
    0 references
    zbMATH Keywords
    graph coloring
    0 references
    average-case complexity
    0 references
    backtrack search
    0 references
    phase transition
    0 references
    random graphs
    0 references
    OpenAlex ID
    W2792593888
    0 references
    cites work
    Q4012216
    0 references
    Q2741512
    0 references
    Q5187324
    0 references
    Q3286850
    0 references
    Q5670645
    0 references
    Q3370783
    0 references
    Q3002782
    0 references
    Wikidata QID
    Q130112805
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4577957&oldid=37661213"
    Powered by MediaWiki