2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Vladimir Kolmogorov, Jack Spalding-Jamieson
We present a family of fast pseudo-approximation algorithms for the minimum balanced element cut problem in a graph, which includes vertex and edge separators. Given a graph $G=(V,…