An Improved Upward Planarity Testing Algorithm and Related Applications

Authors:
Sarmad Abbasi;Patrick Healy;Aimal Rextin
Affiliations:
National University of Computer and Emerging Sciences, Lahore, Pakistan;Computer Science Department, University of Limerick, Ireland;Computer Science Department, University of Limerick, Ireland
Venue:
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Year:
2009

Citing 9
Cited 1

Graph algorithms and NP-completeness

Graph algorithms and NP-completeness
Fundamentals of planar ordered sets

Discrete Mathematics
Algorithms for plane representations of acyclic digraphs

Theoretical Computer Science
Optimal Upward Planarity Testing of Single-Source Digraphs

SIAM Journal on Computing
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Upward Planar Drawing of Single-Source AcyclicDigraphs

SIAM Journal on Computing
On the Computational Complexity of Upward and Rectilinear Planarity Testing

SIAM Journal on Computing
Fixed-Parameter tractable algorithms for testing upward planarity

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Maximum upward planar subgraph of a single-source embedded digraph

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the standard algorithm to test the upward planarity of embedded digraphs by Bertolazzi et al. [3]. We show how to improve its running time from O (n + r 2) to $O(n+r^{\frac{3}{2}})$, where r is the number of sources and sinks in the digraph. We also discuss 2 applications of this technique: finding a certificate of correctness of an implementation of our upward planarity testing algorithm; and improving the running time of getting a quasi-upward planar drawing for an embedded digraph with minimum number of bends.