Frontiers of Information Technology (2012)

Islamabad, Pakistan Pakistan

Dec. 17, 2012 to Dec. 19, 2012

ISBN: 978-1-4673-4946-8

pp: 360-365

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FIT.2012.71

ABSTRACT

A digraph $G=(V, E)$ is \textit{upward planar} if it has a planar drawing with all edges pointing upward. A sub graph $\tilde{G}$ of a digraph $G$ with an upward planar drawing is called a {\it maximal upward planar sub graph} of $G$ if the addition of any edge in $G\backslash\tilde{G}$ to $\tilde{G}$ causes non-upward planarity. Binucci \emph{et al.} showed that finding even the maximum upward planar sub graph of an embedded digraph $G_{\phi}$ is NP-Complete \cite{Walter07}. In this paper, we compare different algorithms to find maximal upward planar sub graph of an embedded digraph. We also use a large test suite of embedded digraphs to gain a deeper understanding of upward planarity and see how the different heuristics perform in practice.

INDEX TERMS

Algorithms, Graph Drawing, Upward Planarity

CITATION

Aimal Tariq Rextin,
"Comparison of Maximal Upward Planar Subgraph Computation Algorithms",

*Frontiers of Information Technology*, vol. 00, no. , pp. 360-365, 2012, doi:10.1109/FIT.2012.71