Answers are grounded in this paper and cite their sources.
This note reveals that relevant cuts are minimum weight cuts, highlighting their importance in directed acyclic graphs.
The set of relevant cuts in a graph is the union of all minimum weight bases of the cut space. We show that a cut is relevant if and only if it is a minimum weight cut between two distinct vertices. Moreover, we give a characterization in terms of Picard-Queyranne Directed Acyclic Graphs that can be used to accelerate the enumeration of the relevant cuts. Finally, we perform an experimental evaluation by comparing with state-of-the-art algorithms.
No takes yet. Share an insight, caveat, or question.
Domschke et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: