Partitioning Biological Networks into Highly Connected Clusters with Maximum …

A popular clustering algorithm for biological networks which was proposed by Hartuv and Shamir [5] identifies nonoverlapping highly connected components. We extend the approach taken by this algorithm by introducing the combinatorial optimization problem HIGHLY CONNECTED DELETION, which asks for removing as few edges as possible from a graph such that the resulting graph consists of highly conn…