64 citations · 124 across the 14 of their papers we have counts for
1 paper · 1 filter
Ben Barber, Joshua Erde
The edge isoperimetric problem for a graph G is to determine, for each n, the minimum number of edges leaving any set of n vertices. In general this problem is NP-hard, but e…