Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs

Abstract

Using the concepts of Eulerian-spanning set and coboundary operator, we generalize Hadlock's conversion of the maxcut problem on planar graphs to one on general graphs with non-negative weights. Using our conversion, we can explore algorithms for maxcut beyond the class of planar graphs. We obtain a Fixed-Parameter Tractable algorithm for $k$-contraction apex graphs. Specifically, our algorithm can be applied to graphs with crossing number $k$, giving an $O(2^k(n+k{)}^{3/2}\log (n+k))$-time algorithm that matches the best known results when restricted to non-negative weights.

arXiv comment6 figures