Solving the minimum labeling global cut problem by mathematical programming

Thiago Gouveia da Silva, Gilberto F. de Sousa Filho, Luiz Satoru Ochi +3

Let G = (V, E, L) be an edge-labeled graph such that V is the set of vertices, E is the set of edges, L is the set of labels (colors) and each edge e \in E has a label l(e) associa…