The algorithmic complexity of mixed domination in graphs (Q533883)

From MaRDI portal
Revision as of 21:29, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
The algorithmic complexity of mixed domination in graphs
scientific article

    Statements

    title
    The algorithmic complexity of mixed domination in graphs (English)
    0 references
    author
    Moo Young Sohn
    0 references
    Yan-Cai Zhao
    0 references
    Li-ying Kang
    0 references
    publication date
    10 May 2011
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    05C69
    0 references
    05C05
    0 references
    zbMATH DE Number
    5886219
    0 references
    zbMATH Keywords
    mixed domination
    0 references
    tree
    0 references
    split graph
    0 references
    algorithm
    0 references
    NP-complete
    0 references
    OpenAlex ID
    W2021417413
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q533883&oldid=31766607"
    Powered by MediaWiki