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, New York, NY, USA , 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
ID Code:596

Repository Staff Only: item control page

References

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.

P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, 6(12):476-497, 1994.

P. Bertolazzi, G. Di Battista, and W. Didimo. Quasi-upward planarity. Algorithmica, 32:474-506, 2002.

P. Healy and W. K. Lynch. Investigations into upward planar digraphs. Technical Report TR-04-02, Dept. of CSIS, University of Limerick, 2004. http://www.csis.ul.ie/Research/TechRpts.htm