The graph partition problem

In this paper, we present a survey about the various graph partition problems, including the clustering problem, the k-cut problem, the multiterminal cut problem, the multicut problem, the sparsest cut problem, the network attack problem, the network disconnection problem. We compare those problems focusing on the problem characteristics such as the objective function and the conditions that the partitioned clusters should satisfy. We also introduce the mathematical programming formulations, and the solution approaches developed for the problems.