1 paper
Nico Domschke, Thomas Gatter, Richard Golnik +1
The set of relevant cuts in a graph is the union of all minimum weight bases of the cut space. A cut is relevant if and only if it is the a minimum weight cut between two distinct…