Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Algorithmic complexity of weakly connected Roman domination in graphs - MaRDI portal

Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025)

From MaRDI portal
scientific article; zbMATH DE number 7539626
Language Label Description Also known as
English
Algorithmic complexity of weakly connected Roman domination in graphs
scientific article; zbMATH DE number 7539626

    Statements

    title
    Algorithmic complexity of weakly connected Roman domination in graphs (English)
    0 references
    publication date
    10 June 2022
    0 references
    zbMATH DE Number
    7539626
    0 references
    zbMATH Keywords
    Roman dominating function
    0 references
    weakly connected Roman domination
    0 references
    APX-completenes
    0 references
    integer linear programming
    0 references
    \(NP\)-completeness
    0 references
    cites work
    Q3579442
    0 references
    Q4198056
    0 references
    Q4368729
    0 references
    Q4368728
    0 references
    Q4918118
    0 references
    OpenAlex ID
    W3149723690
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5866025&oldid=37138495"
    Powered by MediaWiki