Improving the running time of embedded upward planarity testing

Authors:
Sarmad Abbasi;Patrick Healy;Aimal Rextin
Affiliations:
117-BB, Phase IV, DHA, Lahore, Pakistan;Computer Science Department, University of Limerick, Ireland;Computer Science Department, University of Limerick, Ireland
Venue:
Information Processing Letters
Year:
2010

Citing 8
Cited 0

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
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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the standard algorithm by Bertolazzi et al. to test the upward planarity of embedded digraphs. We show how to improve its running time from O(n+r^2) to O(n+r^3^2), where r is the number of sources and sinks in the digraph. We also discuss an application of this technique: improving the running time of getting a quasi-upward planar drawing for an embedded digraph with minimum number of bends.