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)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
NP-completeness and APX-completeness of restrained domination in graphs
scientific article

    Statements

    title
    NP-completeness and APX-completeness of restrained domination in graphs (English)
    0 references
    author
    Weiming Zeng
    0 references
    Lei Chen
    0 references
    Chang-hong Lu
    0 references
    publication date
    9 August 2012
    0 references
    zbMATH Keywords
    NP-complete
    0 references
    APX-complete
    0 references
    approximation ratio
    0 references
    domination problems
    0 references
    restrained domination
    0 references
    cites work
    Q4258216
    0 references
    Q4247463
    0 references
    Q4198056
    0 references
    Q3094567
    0 references
    Q4368728
    0 references
    Q4368729
    0 references
    Q4142699
    0 references

    Identifiers

    zbMATH DE Number
    6064501
    0 references
    Wikidata QID
    Q60630583
    0 references
    OpenAlex ID
    W2039024583
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q442103&oldid=35292513"
    Powered by MediaWiki