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
On the computational complexity of optimization convex covering problems of graphs - MaRDI portal

On the computational complexity of optimization convex covering problems of graphs (Q2209473)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the computational complexity of optimization convex covering problems of graphs
scientific article

    Statements

    title
    On the computational complexity of optimization convex covering problems of graphs (English)
    0 references
    author
    Radu Buzatu
    0 references
    publication date
    2 November 2020
    0 references
    zbMATH Keywords
    NP-hardness
    0 references
    convex cover
    0 references
    convex partition
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C70
    0 references
    68Q17
    0 references
    68R10
    0 references
    zbMATH DE Number
    7268788
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2209473&oldid=26793577"
    Powered by MediaWiki