596
1
archive
7
disk0/00/00/05/96
2005-07-21
2008-09-18 11:08:54
2008-09-18 11:08:54
confpaper
show
0
We show that a digraph is upward planar if and only if its biconnected components have certain properties.
- http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3383&spage=296
-
Healy
Patrick
-
Lynch
Karol
2004
Graph Drawing
New York
-
Pach
János
Pach, János
pub
296-306
FALSE
Springer
FALSE
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
- P.840
- G.770
- P.540
Building Blocks of Upward Planar Digraphs
published
2004
none