7 citations · 9 across the 8 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast
Markus Chimani, Tilo Wiedera
The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph of a given graph such that has maximum edge cardinality. For more than two decades, the only know…
cs.DS2018★ 2 cited
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments
Markus Chimani, Ivo Hedtke, Tilo Wiedera
Given a graph , the NP-hard Maximum Planar Subgraph problem asks for a planar subgraph of with the maximum number of edges. The only known non-trivial exact algorithm utiliz…