Log In Sign Up

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

by   Christine Dahn, et al.

We propose a fixed-parameter tractable algorithm for the Max-Cut problem on embedded 1-planar graphs parametrized 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 algorithm recursively reduces a 1-planar graph to at most 3^k planar graphs, using edge removal and node contraction. The Max-Cut problem is then solved on the planar graphs using established polynomial-time algorithms. We show that a maximum cut in the given 1-planar graph can be derived from the solutions for the planar graphs. Our algorithm computes a maximum cut in an embedded 1-planar graph with n nodes and k edge crossings in time O(3^k · n^3/2 n).


page 1

page 2

page 3

page 4


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

We propose two fixed-parameter tractable algorithms for the weighted Max...

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...

An FPT Algorithm for Max-Cut Parameterized by Crossing Number

The Max-Cut problem is known to be NP-hard on general graphs, while it c...

Max-flow vitality in undirected unweighted planar graphs

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

An Experimental Study of a 1-planarity Testing and Embedding Algorithm

The definition of 1-planar graphs naturally extends graph planarity, nam...

An Approximate Generalization of the Okamura-Seymour Theorem

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