License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SEA.2018.22
URN: urn:nbn:de:0030-drops-89572
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8957/
Go to the corresponding LIPIcs Volume Portal

Chimani, Markus ; Hedtke, Ivo ; Wiedera, Tilo

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

pdf-format:
LIPIcs-SEA-2018-22.pdf (0.6 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{chimani_et_al:LIPIcs:2018:8957,
  author =	{Markus Chimani and Ivo Hedtke and Tilo Wiedera},
  title =	{{Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments}},
  booktitle =	{17th International Symposium on Experimental Algorithms  (SEA 2018)},
  pages =	{22:1--22:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-070-5},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{103},
  editor =	{Gianlorenzo D'Angelo},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8957},
  URN =		{urn:nbn:de:0030-drops-89572},
  doi =		{10.4230/LIPIcs.SEA.2018.22},
  annote =	{Keywords: maximum planar subgraph, integer linear programming, pseudo boolean satisfiability, graph drawing, algorithm engineering}
}

Keywords: maximum planar subgraph, integer linear programming, pseudo boolean satisfiability, graph drawing, algorithm engineering
Collection: 17th International Symposium on Experimental Algorithms (SEA 2018)
Issue Date: 2018
Date of publication: 19.06.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI