Building Blocks of Upward Planar Digraphs

Authors

  • Patrick Healy
  • Karol Lynch

DOI:

https://doi.org/10.7155/jgaa.00135

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.

Downloads

Download data is not yet available.

Downloads

Published

2007-01-01

How to Cite

Healy, P., & Lynch, K. (2007). Building Blocks of Upward Planar Digraphs. Journal of Graph Algorithms and Applications, 11(1), 3–44. https://doi.org/10.7155/jgaa.00135

Issue

Section

Articles

Categories