Optimal clustering of multipartite graphs

DOI10.1016/j.dam.2007.05.033zbMath1144.05050OpenAlexW1980817779MaRDI QIDQ947074

Irène Charon, Olivier Hudry

Publication date: 29 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.033

zbMATH Keywords

complexityclusteringmatchinggraph theoryapproximation of symmetric relations by equivalence relationsclique-partitioningzahn indexZahn's problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

A novel approach to fault tolerant multichannel networks designing problems, Optimal clustering of multipartite graphs, Combinatorial optimization in system configuration design

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analyse qualitativer Daten: Einführung und Übersicht. I
• Optimal clustering of multipartite graphs
• Matching theory
• NP-hard problems in hierarchical-tree clustering
• The median procedure in cluster analysis and social choice theory
• La reduction minimale d'un graphe à une reunion de cliques
• Printer graphics for clustering
• Approximating Symmetric Relations by Equivalence Relations