An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*

Abstract

The densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach is proposed to solve this combinatorial optimisation problem. Numerical experiments show the effectiveness and potential of the proposed approach.