most citedOptimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques

3 citations · 3 across the 1 of their papers we have counts for

collaborators

1 paper

math.OC2022★ 3 cited

Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques

Mishelle Cordero, Andrés Miniguano-Trujillo, Diego Recalde +2

In this work, a graph partitioning problem in a fixed number of connected components is considered. Given an undirected graph with costs on the edges, the problem consists of parti…