Abstract
The upward planarity testing problem consists of testing if a digraph admits a drawing Γ such that all edges in Γ are monotonically increasing in the vertical direction and no edges in Γ cross. In this paper we reduce the problem of testing a digraph for upward planarity to the problem of testing if its blocks admit upward planar drawings with certain properties. We also show how to test if a block of a digraph admits an upward planar drawing with the aforementioned properties.
| Original language | English |
|---|---|
| Pages (from-to) | 3-44 |
| Number of pages | 42 |
| Journal | Journal of Graph Algorithms and Applications |
| Volume | 11 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2007 |