SIAM Journal on Computing
Optimal Upward Planarity Testing of Single-Source Digraphs
SIAM Journal on Computing
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing
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
Fixed-Parameter tractable algorithms for testing upward planarity
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Building blocks of upward planar digraphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
Maximum upward planar subgraphs of embedded planar digraphs
Computational Geometry: Theory and Applications
Maximum upward planar subgraphs of embedded planar digraphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Maximum upward planar subgraph of a single-source embedded digraph
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Switch-Regular upward planar embeddings of trees
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
| Hi-index | 0.00 |
The upward planarity testing problem is known to be NP-hard. We describe an O(n4)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs.