Inverse graph partitioning (IGP) dedicates to maximize the number of edges between these subgraphs and minimize connections inside subgraphs. The IGP problem arises in several practical situations.