2 search results - page 1 / 1 » Covering Complete Hypergraphs with Cuts of Minimum Total Siz... |
113
Voted
GC
2012
Springer
13 years 5 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 ...
JGAA
2000
14 years 10 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...