Results for the maximum weight planar subgraph problem

by   Diane Castonguay, et al.

The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known to be NP-hard, much research effort has been devoted over the years to attempt to improve a given approximate solution to the problem by using local moves applied to a planar embedding of the solution. It has long been established that any feasible solution to the problem, a maximal planar graph, can be transformed into any other (having the same vertex set) in a finite sequence of local moves of based on: (i) edge substitution and (ii) vertex relocation and it has been conjectured that moves of only type (i) are sufficient. In this note we settle this conjecture in the affirmative. Furthermore, contrary to recent supposition, we demonstrate that any maximal spanning tree of the original graph is not necessarily a part of any optimal solution to the problem. We hope these results will be useful in the design of future approximate methods for the problem.



There are no comments yet.


page 1

page 2

page 3

page 4


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

Given a graph G, the NP-hard Maximum Planar Subgraph problem asks for a ...

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

Variable degeneracy on toroidal graphs

Let f be a nonnegative integer valued function on the vertex-set of a gr...

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)

(see paper for full abstract) Given a vertex-weighted directed graph G...

Small Connected Planar Graph with 1-Cop-Move Number 4

This paper describes a 720-vertex connected planar graph G such that cop...

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

A Geometric Approach to Sample Compression

The Sample Compression Conjecture of Littlestone & Warmuth has remained ...
This week in AI

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