2 search results - page 1 / 1 » Packing multiway cuts in capacitated graphs |
73
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G = (V, E) and k commodities, each corresponding to a set of terminal...
IPCO
2010
14 years 11 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...