Abstract
The input of the Maximum Colored Cut problem consists of a graph G = (V, E) with an edge-coloring c : E -> {1, 2, 3,..., p} and a positive integer ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
