Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem (Q3013924)

From MaRDI portal
Revision as of 03:21, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
scientific article

    Statements

    Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem (English)
    0 references
    0 references
    0 references
    19 July 2011
    0 references
    0 references
    maximum \(k\)-plex problem
    0 references
    maximum clique problem
    0 references
    social network analysis
    0 references
    clique relaxations
    0 references
    cohesive subgroups
    0 references
    scale-free graphs
    0 references
    power law graphs
    0 references
    0 references