Abstract
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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Binucci, C., Didimo, W., & Giordano, F. (2008). Maximum upward planar subgraphs of embedded planar digraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4875 LNCS, pp. 195–206). https://doi.org/10.1007/978-3-540-77537-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
