Cuts in Graphs with Matroid Constraints

Aritra Banik, Fedor V. Fomin, Petr A. Golovach +3

{\sc Vertex $(s,t)$-Cut} and {\sc Vertex Multiway Cut} are two fundamental graph separation problems in algorithmic graph theory. We study matroidal generalizations of these probl…