Optimal clustering of multipartite graphs

DOI10.1016/J.DAM.2007.05.033zbMATH Open1144.05050OpenAlexW1980817779MaRDI QIDQ947074FDOQ947074

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

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

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)

Cites Work

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

Cited In (13)

• A novel approach to fault tolerant multichannel networks designing problems
• Clustering in Hypergraphs to Minimize Average Edge Service Time
• Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
• (Semi-)External Algorithms for Graph Partitioning and Clustering
• The clustering matroid and the optimal clustering tree
• Title not available (Why is that?)
• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• Combinatorial optimization in system configuration design
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Optimum cut-based clustering
• Title not available (Why is that?)
• Optimal clustering of multipartite graphs
• A tractable multi-partitions clustering

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)