Log In Sign Up

Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs

by   Christine Dahn, et al.

We propose two fixed-parameter tractable algorithms for the weighted Max-Cut problem on embedded 1-planar graphs parameterized by the crossing number k of the given embedding. A graph is called 1-planar if it can be drawn in the plane with at most one crossing per edge. Our algorithms recursively reduce a 1-planar graph to at most 3^k planar graphs, using edge removal and node contraction. Our main algorithm then solves the Max-Cut problem for the planar graphs using the FCE-MaxCut introduced by Liers and Pardella [21]. In the case of non-negative edge weights, we suggest a variant that allows to solve the planar instances with any planar Max-Cut algorithm. We show that a maximum cut in the given 1-planar graph can be derived from the solutions for the planar graphs. Our algorithms compute a maximum cut in an embedded weighted 1-planar graph with n nodes and k edge crossings in time O(3^k n^3/2 log n).


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

We propose a fixed-parameter tractable algorithm for the Max-Cut problem...

Maximum Cut Parameterized by Crossing Number

Given an edge-weighted graph G on n nodes, the NP-hard Max-Cut problem a...

Inserting an Edge into a Geometric Embedding

The algorithm of Gutwenger et al. to insert an edge e in linear time int...

Efficient Exact Inference in Planar Ising Models

We give polynomial-time algorithms for the exact computation of lowest-e...

Max-flow vitality in undirected unweighted planar graphs

We show a fast algorithm for determining the set of relevant edges in a ...

Bilu-Linial stability, certified algorithms and the Independent Set problem

We study the notion of Bilu-Linial stability in the context of Independe...

An Approximate Generalization of the Okamura-Seymour Theorem

We consider the problem of multicommodity flows in planar graphs. Okamur...