Logo

Login | Create Account

Building Blocks of Upward Planar Digraphs

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

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
Classifications:P Styles > P.840 Upward
G Algorithms and Complexity > G.770 Planarity Testing
P Styles > P.540 Planar
ID Code:596
Deposited By:Selbach, Anna
Deposited On:21 Jul 2005
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3383&spage=296

Repository Staff Only: item control page

References

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

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.