We introduce 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 connected components. We show that Highly Connected Deletion is NP-hard and provide a fixed-parameter algorithm and a kernelization. We propose exact and heuristic solution strategies, based on polynomial-time data reduction rules and integer linear programming with column generation. The data reduction typically identifies 85 % of the edges that need to be deleted for an optimal solution; the column generation method can then optimally solve protein interaction networks with up to 5 000 vertices and 12 000 edges. © 2013 Springer-Verlag.
CITATION STYLE
Hüffner, F., Komusiewicz, C., Liebtrau, A., & Niedermeier, R. (2013). Partitioning biological networks into highly connected clusters with maximum edge coverage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7875 LNBI, pp. 99–111). https://doi.org/10.1007/978-3-642-38036-5_13
Mendeley helps you to discover research relevant for your work.