Login / Signup
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.
Christine Dahn
Nils M. Kriege
Petra Mutzel
Published in:
CoRR (2018)
Keyphrases
</>
planar graphs
k means
max cut
optimal solution
worst case
dynamic programming
np hard
least squares
computational complexity
image segmentation
lower bound
parameter estimation
monte carlo
convex hull
knapsack problem
graph partitioning
objective function