2 papers
cs.DS2018
Maximum cuts in edge-colored graphs
Luerbio Faria, Sulamita Klein, Ignasi Sau +2
The input of the Maximum Colored Cut problem consists of a graph with an edge-coloring and a positive integer , and the question is wheth…
cs.DS2015
Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs
Luerbio Faria, Sulamita Klein, Ignasi Sau +1
A graph is signed if each edge is assigned or . A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign if and only if its…