Finding Connected Dense $$k$$-Subgraphs (Q2948471)

From MaRDI portal
Revision as of 20:16, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Finding Connected Dense $$k$$-Subgraphs
scientific article

    Statements

    title
    Finding Connected Dense $$k$$-Subgraphs (English)
    0 references
    author
    Xu-jin Chen
    0 references
    Xiao-Dong Hu
    0 references
    Changjun Wang
    0 references
    publication date
    30 September 2015
    0 references
    zbMATH Keywords
    densest \(k\)-subgraphs
    0 references
    connectivity
    0 references
    combinatorial approximation algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C40
    0 references
    05C42
    0 references
    05C85
    0 references
    68W25
    0 references
    zbMATH DE Number
    6487895
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2948471&oldid=15936450"
    Powered by MediaWiki