Abstract
We show that a digraph is upward planar if and only if its biconnected components have certain properties.
Chapter PDF
Similar content being viewed by others
References
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)
Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 6(12), 476–497 (1994)
Bertolazzi, P., Di Battista, G., Didimo, W.: Quasi-upward planarity. Algorithmica 32, 474–506 (2002)
Healy, P., Lynch, W.K.: 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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Healy, P., Lynch, K. (2005). Building Blocks of Upward Planar Digraphs. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)