Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (Q5326561)

From MaRDI portal
Revision as of 23:00, 19 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59567500, #quickstatements; #temporary_batch_1710879948957)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6195425
Language Label Description Also known as
English
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
scientific article; zbMATH DE number 6195425

    Statements

    Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references