creators_name: Healy, Patrick
creators_name: Lynch, Karol
editors_name: Pach, János
editors_id: Pach, János
type: confpaper
datestamp: 2005-07-21
lastmod: 2008-09-18 11:08:54
metadata_visibility: show
title: Building Blocks of Upward Planar Digraphs
ispublished: pub
subjects: P.840
subjects: G.770
subjects: P.540
full_text_status: none
abstract: We show that a digraph is upward planar if and only if its biconnected components have certain properties.

date: 2004
date_type: published
publisher: Springer
pagerange: 296-306
refereed: FALSE
referencetext: 1. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.
2. P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, 6(12):476-497, 1994.
3. P. Bertolazzi, G. Di Battista, and W. Didimo. Quasi-upward planarity. Algorithmica, 32:474-506, 2002.
4. 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

citation: Healy, Patrick and Lynch, Karol (2004) Building Blocks of Upward Planar Digraphs. [Conference Paper]