2026-07-22T11:40:55Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8957 2024-03-12T11:57:59Z ddc:004 open_access

Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments Chimani, Markus Hedtke, Ivo Wiedera, Tilo maximum planar subgraph integer linear programming pseudo boolean satisfiability graph drawing algorithm engineering 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Markus Chimani and Ivo Hedtke and Tilo Wiedera 2018 Is Part Of LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SEA.2018.22 urn:nbn:de:0030-drops-89572 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.22 eng https://creativecommons.org/licenses/by/3.0/legalcode