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

04/19/2018
by   Markus Chimani, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2018

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...
research
01/22/2023

On the size of maximum cut in planar graphs

We show that the size of maximum cut in a planar graph with m edges is a...
research
12/15/2017

Results for the maximum weight planar subgraph problem

The problem of finding the maximum-weight, planar subgraph of a finite, ...
research
08/29/2023

Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem

A vertex of a plane digraph is bimodal if all its incoming edges (and he...
research
03/30/2020

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...
research
07/27/2018

Alternating Path and Coloured Clustering

In the Coloured Clustering problem, we wish to colour vertices of an edg...
research
07/06/2021

A General Approach to Approximate Multistage Subgraph Problems

In a Subgraph Problem we are given some graph and want to find a feasibl...

Please sign up or login with your details

Forgot password? Click here to reset