Optimal clustering of multipartite graphs (Q947074): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5685119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The median procedure in cluster analysis and social choice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal clustering of multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Printer graphics for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard problems in hierarchical-tree clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyse qualitativer Daten: Einführung und Übersicht. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: La reduction minimale d'un graphe à une reunion de cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Symmetric Relations by Equivalence Relations / rank
 
Normal rank

Latest revision as of 16:47, 28 June 2024

scientific article
Language Label Description Also known as
English
Optimal clustering of multipartite graphs
scientific article

    Statements

    Optimal clustering of multipartite graphs (English)
    0 references
    0 references
    0 references
    29 September 2008
    0 references
    graph theory
    0 references
    clique-partitioning
    0 references
    Zahn's problem
    0 references
    zahn index
    0 references
    approximation of symmetric relations by equivalence relations
    0 references
    clustering
    0 references
    complexity
    0 references
    matching
    0 references

    Identifiers