Partition-distance: A problem and class of perfect graphs arising in clustering (Q1603544)

From MaRDI portal
Revision as of 20:39, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Partition-distance: A problem and class of perfect graphs arising in clustering
scientific article

    Statements

    Partition-distance: A problem and class of perfect graphs arising in clustering (English)
    0 references
    0 references
    14 July 2002
    0 references
    0 references
    partitioning
    0 references
    clustering
    0 references
    assignment problem
    0 references
    node cover
    0 references
    perfect graph
    0 references
    genetics
    0 references
    graph algorithms
    0 references
    combinatorial problems
    0 references