Building Blocks of Upward Planar Digraphs

Healy, Patrick and Lynch, Karol (2004) Building Blocks of Upward Planar Digraphs. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 296-306(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_30).

Full text not available from this repository.

Abstract

We show that a digraph is upward planar if and only if its biconnected components have certain properties.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-31843-9_30
Classifications: P Styles > P.840 Upward
G Algorithms and Complexity > G.770 Planarity Testing
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/596

Actions (login required)

View Item View Item