Parameterized Complexity of Critical Node Cuts (Q5363787)

From MaRDI portal
scientific article; zbMATH DE number 6784982
Language Label Description Also known as
English
Parameterized Complexity of Critical Node Cuts
scientific article; zbMATH DE number 6784982

    Statements

    0 references
    0 references
    0 references
    0 references
    29 September 2017
    0 references
    graph-cut problem
    0 references
    NP-hard problem
    0 references
    treewidth
    0 references
    Parameterized Complexity of Critical Node Cuts (English)
    0 references

    Identifiers