Theoretical Computer Science / Theoretische Informatik

Institut[e] f(o|ü)r Informati(cs|k), [Universität] Osnabrück [University]

User Tools


Maximum Planar Subgraph

Here you can find experimental results from two of our papers that deal with exactly computing maximum planar subgraphs. For each instance, we provide the optimal solution (if solved) and the runtime for each of the algorithmic variants. Empty cells in the latter columns indicate that the respective algorithm did not terminate in time. The set of random regular graphs that we generated is also available for download.

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

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

research/mps.txt · Last modified: September 18, 2018 (08:41) by wiedera