Global Minimum Cuts in Surface-Embedded Graphs

Chambers, Erin Wolf; Erickson, Jeff; Fox, Kyle; Nayyeri, Amir

doi:10.1007/978-1-4939-2864-4_683

Cited by 1 publication

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ghrist and Krishnan [26] prove a topological version of the max-flow min-cut theorem for directed networks using methods from sheaf theory. Then, there is also a long line of work on cuts in surface embedded graphs [2,3,8,9,10,11], which is algorithmic in spirit and is loosely related to our work. The figure shows two cycles that belong to [ζ] in green.…”

Section: Related Workmentioning

confidence: 99%

The complexity of high-dimensional cuts

Bauer¹,

Rathod²,

Zehavi³

2021

Preprint

View full text Add to dashboard Cite

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 the minimum k-way cut are some of the commonly encountered cut problems. Many of these problems have been extensively studied over several decades. In this paper, we initiate the algorithmic study of some cut problems in high dimensions.The first problem we study, namely, Topological Hitting Set (THS), is defined as follows: Given a nontrivial r-cycle ζ in a simplicial complex K, find a set S of r-dimensional simplices of minimum cardinality so that S meets every cycle homologous to ζ. Our main result is that this problem admits a polynomial time solution on triangulations of closed surfaces. Interestingly, the optimal solution is given in terms of the cocycles of the surface. For general complexes, we show that THS is W[1]-hard with respect to the solution size k. On the positive side, we show that THS admits an FPT algorithm with respect to k + d, where d is the maximum degree of the Hasse graph of the complex K.We also define a problem called Boundary Nontrivialization (BNT): Given a bounding rcycle ζ in a simplicial complex K, find a set S of (r + 1)-dimensional simplices of minimum cardinality so that the removal of S from K makes ζ non-bounding. We show that BNT is W[1]-hard with respect to the solution size as the parameter, and has an O(log n)-approximation FPT algorithm for (r + 1)-dimensional complexes with the (r + 1)-th Betti number βr+1 as the parameter. Finally, we provide randomized (approximation) FPT algorithms for the global variants of THS and BNT.

show abstract