Login / Signup
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.
Luérbio Faria
Sulamita Klein
Ignasi Sau
Rubens Sucupira
Published in:
Discret. Math. Theor. Comput. Sci. (2017)
Keyphrases
</>
max cut
lower bound
np hard
graph model
upper bound
planar graphs
graph partitioning
branch and bound
branch and bound algorithm
np complete problems
spectral graph
optimal solution
worst case
approximation algorithms
np complete
pairwise
objective function
lower and upper bounds
min max
kernel methods