An integer programming approach for finding the most and the least central cliques (Q2341092)

From MaRDI portal
Revision as of 23:34, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An integer programming approach for finding the most and the least central cliques
scientific article

    Statements

    title
    An integer programming approach for finding the most and the least central cliques (English)
    0 references
    author
    Chrysafis Vogiatzis
    0 references
    Alexander Veremyev
    0 references
    Panos M. Pardalos
    0 references
    Eduardo L. Pasiliao
    0 references
    publication date
    23 April 2015
    0 references
    zbMATH Keywords
    clique
    0 references
    group centrality
    0 references
    integer formulation
    0 references
    describes a project that uses
    NetworkX
    0 references
    SparseMatrix
    0 references
    DIMACS
    0 references
    Algorithm 97
    0 references

    Identifiers

    zbMATH DE Number
    6429230
    0 references
    OpenAlex ID
    W2051477098
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2341092&oldid=35451047"
    Powered by MediaWiki