Maximum Upward Planar Subgraphs of Embedded Planar Digraphs

Let G be an embedded planar digraph. A maximum upward planar subgraph of G is an embedding preserving subgraph that is upward planar and, among those, has the maximum number of edges. This paper presents an extensive study on the problem of computing maximum upward planar subgraphs of embedded planar digraphs: Complexity results, algorithms, and experiments are presented. Namely: (i) we prove that the addressed problem is NP-Hard; (ii) a fast heuristic and an exponential-time exact algorithm are described; (iii) a wide experimental analysis is performed to show the effectiveness of our techniques.