Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments

by   Markus Chimani, et al.

Given a graph G, the NP-hard Maximum Planar Subgraph problem asks for a planar subgraph of G with the maximum number of edges. The only known non-trivial exact algorithm utilizes Kuratowski's famous planarity criterion and can be formulated as an integer linear program (ILP) or a pseudo-boolean satisfiability problem (PBS). We examine three alternative characterizations of planarity regarding their applicability to model maximum planar subgraphs. For each, we consider both ILP and PBS variants, investigate diverse formulation aspects, and evaluate their practical performance.



page 1

page 2

page 3

page 4


Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast

The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph H...

Results for the maximum weight planar subgraph problem

The problem of finding the maximum-weight, planar subgraph of a finite, ...

The complexity of the Bondage problem in planar graphs

A set S⊆ V(G) of a graph G is a dominating set if each vertex has a neig...

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem

One of many different hierarchies towards the stability number of a grap...

A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs

A cactus graph is a graph in which any two cycles are edge-disjoint. We ...

Alternating Path and Coloured Clustering

In the Coloured Clustering problem, we wish to colour vertices of an edg...

Convex optimization for the densest subgraph and densest submatrix problems

We consider the densest k-subgraph problem, which seeks to identify the ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.