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
The densest \(k\)-subgraph problem on clique graphs - MaRDI portal

The densest \(k\)-subgraph problem on clique graphs (Q2426654)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The densest \(k\)-subgraph problem on clique graphs
scientific article

    Statements

    title
    The densest \(k\)-subgraph problem on clique graphs (English)
    0 references
    author
    Maria Liazi
    0 references
    Fanny Pascual
    0 references
    Ioannis Milis
    0 references
    publication date
    23 April 2008
    0 references
    zbMATH Keywords
    Clique graph
    0 references
    Polynomial time approximation scheme
    0 references
    Dynamic programming
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90C35
    0 references
    90C39
    0 references
    zbMATH DE Number
    5266856
    0 references
    OpenAlex ID
    W2007362596
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2426654&oldid=35050890"
    Powered by MediaWiki