New algorithms for the Minimum Coloring Cut Problem

Augusto Bordini, Fábio Protti

The Minimum Coloring Cut Problem is defined as follows: given a connected graph G with colored edges, find an edge cut E' of G (a minimal set of edges whose removal renders the gra…