Algorithmic aspects of Roman domination in graphs (Q2053064)

From MaRDI portal
Revision as of 22:16, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Algorithmic aspects of Roman domination in graphs
scientific article

    Statements

    title
    Algorithmic aspects of Roman domination in graphs (English)
    0 references
    publication date
    29 November 2021
    0 references
    zbMATH Keywords
    Roman domination
    0 references
    tree convex bipartite graph
    0 references
    NP-completeness
    0 references
    APX-complete
    0 references

    Identifiers

    zbMATH DE Number
    7435125
    0 references
    OpenAlex ID
    W3016425788
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2053064&oldid=32140745"
    Powered by MediaWiki