On the Fine-Grained Complexity of Rainbow Coloring (Q3174728)

From MaRDI portal
Revision as of 00:13, 28 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129519337, #quickstatements; #temporary_batch_1724796091478)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Fine-Grained Complexity of Rainbow Coloring
scientific article

    Statements

    title
    On the Fine-Grained Complexity of Rainbow Coloring (English)
    0 references
    DOI
    10.1137/16M1102690
    0 references
    author
    Łukasz Kowalik
    0 references
    Juho Lauri
    0 references
    Arkadiusz Socała
    0 references
    publication date
    18 July 2018
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C85
    0 references
    68W05
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6904931
    0 references
    zbMATH Keywords
    graph coloring
    0 references
    computational complexity
    0 references
    lower bounds
    0 references
    FPT algorithms
    0 references
    OpenAlex ID
    W2963963322
    0 references
    Wikidata QID
    Q129519337
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3174728&oldid=37642669"
    Powered by MediaWiki