Complexity and approximability of the <i>k</i>‐way vertex cut (Q4639693)

From MaRDI portal
Revision as of 01:45, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57338948, #quickstatements; #temporary_batch_1711055989931)
scientific article; zbMATH DE number 6867786
Language Label Description Also known as
English
Complexity and approximability of the <i>k</i>‐way vertex cut
scientific article; zbMATH DE number 6867786

    Statements

    Complexity and approximability of the <i>k</i>‐way vertex cut (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2018
    0 references
    planar graph
    0 references
    separator
    0 references
    connectivity
    0 references
    computational complexity
    0 references
    approximation scheme
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references