collaborators

1 paper

cs.DS2026

On the Parameterized Complexity of Conflict-Free Edge Cut in Undirected Graphs

Sourav Das, Ashwin Jacob, Arpit Kumar +1

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 t…