Login / Signup

A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.

Christine DahnNils M. KriegePetra Mutzel
Published in: IWOCA (2018)
Keyphrases
  • max cut
  • computational complexity
  • dynamic programming
  • objective function
  • probabilistic model
  • optimal solution
  • np hard
  • worst case
  • linear programming
  • monte carlo
  • planar graphs
  • convex hull