3 papers
cs.DS2019
Maximum Cut Parameterized by Crossing Number
Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke +3
Given an edge-weighted graph on nodes, the NP-hard Max-Cut problem asks for a node bipartition such that the sum of edge weights joining the different partitions is maximiz…
cs.DS2018
Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs
Christine Dahn, Nils M. Kriege, Petra Mutzel +1
We propose two fixed-parameter tractable algorithms for the weighted Max-Cut problem on embedded 1-planar graphs parameterized by the crossing number of the given embedding. A…
cs.DS2018
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
Christine Dahn, Nils M. Kriege, Petra Mutzel
We propose a fixed-parameter tractable algorithm for the \textsc{Max-Cut} problem on embedded 1-planar graphs parameterized by the crossing number of the given embedding. A gra…