scientific article; zbMATH DE number 7378689

DOI10.4230/LIPIcs.ESA.2018.19MaRDI QIDQ5009576

Markus Chimani, Tilo Wiedera

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1806.08283

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integer linear programminggraph algorithmsalgorithm engineeringmaximum planar subgraph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Stronger ILPs for the Graph Genus Problem.

Uses Software

• SCIP
• SteinLib
• OGDF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-planar core reduction of graphs
• Maximal planar subgraphs of fixed girth in random graphs
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• A tighter insertion-based approximation of the crossing number
• An experimental comparison of four graph drawing algorithms.
• Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem
• A Note on the Practicality of Maximal Planar Subgraph Algorithms
• Finding Triangles for Maximum Planar Subgraphs
• A Better Approximation Algorithm for Finding Planar Subgraphs
• Efficient Extraction of Multiple Kuratowski Subdivisions
• Probability and Computing
• Advances in the Planarization Method: Effective Multiple Edge Insertions

This page was built for publication: