164
click to vote
GC
13 years 9 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 ...
|
Applied Computing