A Note on the Practicality of Maximal Planar Subgraph Algorithms
Data Structures and Algorithms
2016-08-29 v1 Computational Complexity
Abstract
Given a graph , the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of with the maximum number of edges. There are several heuristic, approximative, and exact algorithms to tackle the problem, but---to the best of our knowledge---they have never been compared competitively in practice. We report on an exploratory study on the relative merits of the diverse approaches, focusing on practical runtime, solution quality, and implementation complexity. Surprisingly, a seemingly only theoretically strong approximation forms the building block of the strongest choice.
Cite
@article{arxiv.1608.07505,
title = {A Note on the Practicality of Maximal Planar Subgraph Algorithms},
author = {Markus Chimani and Karsten Klein and Tilo Wiedera},
journal= {arXiv preprint arXiv:1608.07505},
year = {2016}
}
Comments
Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016)