Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649)

From MaRDI portal
Revision as of 15:23, 31 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fine-grained parameterized complexity analysis of graph coloring problems
scientific article

    Statements

    Fine-grained parameterized complexity analysis of graph coloring problems (English)
    0 references
    0 references
    0 references
    11 January 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    fixed-parameter tractability
    0 references
    fine-grained complexity
    0 references
    structural parameterizations
    0 references
    strong exponential time hypothesis
    0 references