Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (Q4554340)

From MaRDI portal
Revision as of 08:26, 31 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6979203
Language Label Description Also known as
English
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
scientific article; zbMATH DE number 6979203

    Statements

    Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (English)
    0 references
    0 references
    0 references
    0 references
    13 November 2018
    0 references
    SETH
    0 references
    treewidth
    0 references
    lower bounds
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references