FPT Inapproximability of Directed Cut and Connectivity Problems (Q5875540)

From MaRDI portal
Revision as of 17:44, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7650216
Language Label Description Also known as
English
FPT Inapproximability of Directed Cut and Connectivity Problems
scientific article; zbMATH DE number 7650216

    Statements

    0 references
    0 references
    3 February 2023
    0 references
    directed graphs
    0 references
    cuts
    0 references
    connectivity
    0 references
    Steiner problems
    0 references
    FPT inapproximability
    0 references
    FPT Inapproximability of Directed Cut and Connectivity Problems (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references