GC
2012
Springer
12 years 8 months ago
2012
Springer
A cut [X, V − X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V − X. Let sr(n) denote the minimum total size of any cover of the edges of the ...
SIAMCOMP
2011
13 years 3 months ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...