Clustering data that are graph connected (Q1753555)

From MaRDI portal
Revision as of 08:20, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    describes a project that uses
    Inc-cluster
    0 references
    SA-cluster
    0 references
    CRIO
    0 references
    cites work
    Correlation clustering
    0 references
    Q5379095
    0 references
    Min-cut clustering
    0 references
    Q3322995
    0 references
    Q5501301
    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
    OpenAlex ID
    W2587957618
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1753555&oldid=38729704"
    Powered by MediaWiki