2024/10/26 by Domschke, Nico, Gatter, Thomas, Golnik, Richard +1 · 1 citation
Engineering · #Combinatorics (math.CO) #FOS: Mathematics #Manufacturing Process and Optimization #Material Properties and Processing
paper · pdf · doi:10.48550/arxiv.2410.20257
openalex publication_date 2024/10/26 · openalex created_date 2024/11/14 · openalex updated_date 2026/08/03
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 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.