Maximum upward planar subgraph of a single-source embedded digraph

Authors:
Aimal Rextin;Patrick Healy
Affiliations:
Department of Computing, National University of Science Technology, Pakistan;Computer Science Department, University of Limerick, Ireland
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 10
Cited 0

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
Maximum upward planar subgraphs of embedded planar digraphs

Computational Geometry: Theory and Applications
An Improved Upward Planarity Testing Algorithm and Related Applications

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Maximum upward planar subgraphs of embedded planar digraphs

GD'07 Proceedings of the 15th international conference on Graph drawing
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

We show how to compute a maximum upward planar singlesource subgraph of a single-source embedded DAG Gφ. We first show that finding a maximum upward planar subgraph of a single-source embedded digraph is NP-complete. We then give a new characterization of upward planar single-source digraphs. We use this characterization to present an algorithm that computes a maximum upward planar single-source subgraph of a single-source embedded DAG. This algorithm takes O(n4) time in the worst case and O(n3) time on average.