The complexity of high-dimensional cuts

Ulrich Bauer, Abhishek Rathod, Meirav Zehavi

Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. For instance, the minimum cut, the minimum $s$-$t$ cut, the minimum multiway cut, and…