The complexity of secure domination problem in graphs (Q1708386)

From MaRDI portal
Revision as of 08:16, 15 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
The complexity of secure domination problem in graphs
scientific article

    Statements

    title
    The complexity of secure domination problem in graphs (English)
    0 references
    publication date
    23 March 2018
    0 references
    zbMATH Keywords
    secure domination
    0 references
    star convex bipartite graph
    0 references
    doubly chordal graph
    0 references
    NP-completeness
    0 references
    APX-completeness
    0 references
    author
    Hai-Chao Wang
    0 references
    Yan-Cai Zhao
    0 references
    Yun-Ping Deng
    0 references

    Identifiers

    DOI
    10.7151/dmgt.2008
    0 references
    zbMATH DE Number
    6852326
    0 references
    OpenAlex ID
    W2738841429
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1708386&oldid=36380171"
    Powered by MediaWiki