NP-completeness and APX-completeness of restrained domination in graphs (Q442103)

From MaRDI portal
Revision as of 12:41, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
NP-completeness and APX-completeness of restrained domination in graphs
scientific article

    Statements

    NP-completeness and APX-completeness of restrained domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 August 2012
    0 references
    NP-complete
    0 references
    APX-complete
    0 references
    approximation ratio
    0 references
    domination problems
    0 references
    restrained domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers