Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.20257 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911480086003712 |
|---|---|
| author | Domschke, Nico Gatter, Thomas Golnik, Richard Stadler, Peter F. |
| author_facet | Domschke, Nico Gatter, Thomas Golnik, Richard Stadler, Peter F. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_20257 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Short Note on Relevant Cuts Domschke, Nico Gatter, Thomas Golnik, Richard Stadler, Peter F. Combinatorics 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. |
| title | A Short Note on Relevant Cuts |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2410.20257 |