Nacionalni portal odprte znanosti

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 ...