Optimal clustering of multipartite graphs

DOI10.1016/J.DAM.2007.05.033MaRDI QIDQ947074zbMATH OpenOpenAlexFDO

Authors 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

clusteringgraph theorymatchingcomplexityapproximation of symmetric relations by equivalence relationsclique-partitioningzahn indexZahn's problem

Mathematics Subject Classification ID

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

Recommendations

• Cluster graph modification problems
• scientific article; zbMATH DE number 1953109
• Clustering and domination in perfect graphs
• Clustering minimum biclique completion of a bipartite graph
• On bipartite and multipartite clique problems

Cites work

• scientific article; zbMATH DE number 3852234 (Why is no real title available?)
• scientific article; zbMATH DE number 3854180 (Why is no real title available?)
• scientific article; zbMATH DE number 3980481 (Why is no real title available?)
• scientific article; zbMATH DE number 3632297 (Why is no real title available?)
• scientific article; zbMATH DE number 745864 (Why is no real title available?)
• scientific article; zbMATH DE number 3420808 (Why is no real title available?)
• Analyse qualitativer Daten: Einführung und Übersicht. I
• Approximating Symmetric Relations by Equivalence Relations
• La reduction minimale d'un graphe à une reunion de cliques
• Matching theory
• NP-hard problems in hierarchical-tree clustering
• Optimal clustering of multipartite graphs
• Printer graphics for clustering
• The median procedure in cluster analysis and social choice theory

Cited in

(15)

• A tractable multi-partitions clustering
• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• scientific article; zbMATH DE number 1302183 (Why is no real title available?)
• Optimal clustering of multipartite graphs
• Clustering in Hypergraphs to Minimize Average Edge Service Time
• Optimum cut-based clustering
• Coherent network partitions
• Combinatorial optimization in system configuration design
• Optimal hierarchical clustering on a graph
• The clustering matroid and the optimal clustering tree
• (Semi-)External Algorithms for Graph Partitioning and Clustering
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• scientific article; zbMATH DE number 5379591 (Why is no real title available?)
• Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
• A novel approach to fault tolerant multichannel networks designing problems

This page was built for publication: Optimal clustering of multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947074)