Dense Graph Partitioning on sparse and dense graphs

Cristina Bazgan, Katrin Casel, Pierre Cazals

We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of t…