Algorithmic results in secure total dominating sets on graphs (Q2136269)

From MaRDI portal
Revision as of 23:07, 28 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
Algorithmic results in secure total dominating sets on graphs
scientific article

    Statements

    title
    Algorithmic results in secure total dominating sets on graphs (English)
    0 references
    author
    Abolfazl Poureidi
    0 references
    publication date
    10 May 2022
    0 references
    zbMATH DE Number
    7524427
    0 references
    zbMATH Keywords
    secure total dominating set
    0 references
    linear-time algorithm
    0 references
    NP-complete
    0 references
    APX-complete
    0 references
    OpenAlex ID
    W4221042980
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2136269&oldid=36799508"
    Powered by MediaWiki