Optimal clustering of multipartite graphs

Authors:
Irène Charon;Olivier Hudry
Affiliations:
GET-ícole Nationale Supérieure des Télécommunications and CNRS LTCI-UMR 5141, 46, rue Barrault, 75634 Paris cedex 13, France;GET-ícole Nationale Supérieure des Télécommunications and CNRS LTCI-UMR 5141, 46, rue Barrault, 75634 Paris cedex 13, France
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 2
Cited 2

NP-hard problems in hierarchical-tree clustering

Acta Informatica
Clustering Algorithms

Clustering Algorithms

Combinatorial optimization in system configuration design

Automation and Remote Control
A novel approach to fault tolerant multichannel networks designing problems

Annales UMCS, Informatica

Quantified Score

Hi-index	0.05

Visualization

Abstract

Given a graph G=(X,U), the problem dealt within this paper consists in partitioning X into a disjoint union of cliques by adding or removing a minimum number z(G) of edges (Zahn's problem). While the computation of z(G) is NP-hard in general, we show that its computation can be done in polynomial time when G is bipartite, by relating it to a maximum matching problem. When G is a complete multipartite graph, we give an explicit formula specifying z(G) with respect to some structural features of G. In both cases, we give also the structure of all the optimal clusterings of G.