263 citations · 477 across the 5 of their papers we have counts for
1 paper · 1 filter
Allon G. Percus, Gabriel Istrate, Bruno Goncalves +2
The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut"…