Dense and Sparse Graph Partition
Résumé
In a graph, the density is the ratio between the number of edges and the number of vertices. This criterion may be used to find communities in a graph: groups of highly connected vertices. We propose an optimization problem based on this criterion, the idea is to find the vertex partition that maximizes the sum of the densities of each class. We prove that this problem is NP-hard by giving a reduction from graph-k-colorability. Additionally, we give a polynomial time algorithm for the special case of trees.
Domaines
Recherche opérationnelle [math.OC]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...