Preprint
Oct 2026
On the Parameterized Complexity of Conflict-Free Edge Cut in Undirected Graphs
In this paper, we study CONFLICT-FREE EDGE CUT (CF-CUT), which is a recently introduced conflict-free version of the MIN-CUT problem that asks to find the minimum number of edges to disconnect a connected graph. The CF-CUT takes as input a connected undirected graph G = (V, E), a conflict graph $\widehat{G}$ such that...
Sourav Das, Ashwin Jacob, Arpit Kumar et al.
· 0 citations