30 citations · 158 across the 36 of their papers we have counts for
1 paper · 2 filters
René van Bevern, Andreas Emil Feldmann, Manuel Sorge +1
A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition t…