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
Complexity of paired domination in at-free and planar graphs - MaRDI portal

Complexity of paired domination in at-free and planar graphs (Q6102264)

From MaRDI portal
scientific article; zbMATH DE number 7683163
Language Label Description Also known as
English
Complexity of paired domination in at-free and planar graphs
scientific article; zbMATH DE number 7683163

    Statements

    title
    Complexity of paired domination in at-free and planar graphs (English)
    0 references
    author
    Vikash Tripathi
    0 references
    Ton Kloks
    0 references
    Arti Pandey
    0 references
    Kaustav K. Paul
    0 references
    Hung-Lung Wang
    0 references
    publication date
    8 May 2023
    0 references
    zbMATH Keywords
    domination
    0 references
    paired domination
    0 references
    planar graphs
    0 references
    at-free graphs
    0 references
    graph algorithms
    0 references
    NP-completeness
    0 references
    approximation algorithm
    0 references

    Identifiers

    arXiv ID
    2112.05486
    0 references
    zbMATH DE Number
    7683163
    0 references
    OpenAlex ID
    W4225525972
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6102264&oldid=37514151"
    Powered by MediaWiki