The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
scientific article

    Statements

    The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (English)
    0 references
    0 references
    0 references
    29 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity
    0 references
    NP-completeness
    0 references
    NP-hardness
    0 references
    domination
    0 references
    bondage
    0 references
    total bondage
    0 references
    reinforcement
    0 references
    total reinforcement
    0 references
    0 references
    0 references