Clustering data that are graph connected (Q1753555)

From MaRDI portal
Revision as of 06:48, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Clustering data that are graph connected
scientific article

    Statements

    title
    Clustering data that are graph connected (English)
    0 references
    author
    Stefano Benati
    0 references
    Justo Puerto
    0 references
    publication date
    29 May 2018
    0 references
    zbMATH Keywords
    combinatorial optimization
    0 references
    clustering
    0 references
    clique partitioning
    0 references
    integer programming
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C35
    0 references
    62H30
    0 references
    05C90
    0 references
    90C10
    0 references
    90C27
    0 references
    zbMATH DE Number
    6875846
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1753555&oldid=14085659"
    Powered by MediaWiki