4 citations · 7 across the 5 of their papers we have counts for
1 paper · 2 filters
Anand Louis, Rakesh Venkat
The problem of computing the vertex expansion of a graph is an NP-hard problem. The current best worst-case approximation guarantees for computing the vertex expansion of a graph a…