A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs

Authors:
Aimal Rextin;Patrick Healy
Affiliations:
Computer Science Department, University of Limerick, Ireland;Computer Science Department, University of Limerick, Ireland
Venue:
Graph Drawing
Year:
2009

Citing 9
Cited 0

On-line planar graph embedding

Journal of Algorithms
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
Upward Planarity Testing of Outerplanar Dags

GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Two Simplified Algorithms for Maintaining Order in a List

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Upward spirality and upward planarity testing

GD'05 Proceedings of the 13th international conference on Graph Drawing
Computing upward planar drawings using switch-regularity heuristics

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a dynamic algorithm that checks if a single-source embedded digraph is upward planar in the presence of edge insertions and edge deletions. Let G φ be an upward planar single-source embedded digraph and let G′ φ′ be a single-source embedded digraph obtained by updating G φ . We show that the upward planarity of G′ φ′ can be checked in O(logn) amortized time when the external face is fixed.