Worst-case efficient dominating sets in digraphs (Q1949100)

From MaRDI portal
Revision as of 14:58, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Worst-case efficient dominating sets in digraphs
scientific article

    Statements

    title
    Worst-case efficient dominating sets in digraphs (English)
    0 references
    publication date
    25 April 2013
    0 references
    zbMATH Keywords
    Cayley graph
    0 references
    star graph
    0 references
    digraph
    0 references
    efficient dominating set
    0 references
    author
    Italo Jose Dejter
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C69
    0 references
    05C20
    0 references
    05C25
    0 references
    zbMATH DE Number
    6157657
    0 references
    OpenAlex ID
    W1973259076
    0 references
    arXiv ID
    1201.1728
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1949100&oldid=38806196"
    Powered by MediaWiki