1 citations · 2 across the 6 of their papers we have counts for
1 paper · 2 filters
Cédric Bentz
Given a list of k source-sink pairs in an edge-weighted graph G, the minimum multicut problem consists in selecting a set of edges of minimum total weight in G, such that removing…