7 citations · 9 across the 8 of their papers we have counts for
1 paper · 1 filter
Markus Chimani, Karsten Klein, Tilo Wiedera
Given a graph G, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of G with the maximum number of edges. There are several heuristic, approximative,…