Building Blocks of Upward Planar Digraphs

  • Patrick Healy
  • Karol Lynch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)

Abstract

We show that a digraph is upward planar if and only if its biconnected components have certain properties.

References

  1. 1.
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)MATHGoogle Scholar
  2. 2.
    Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 6(12), 476–497 (1994)CrossRefGoogle Scholar
  3. 3.
    Bertolazzi, P., Di Battista, G., Didimo, W.: Quasi-upward planarity. Algorithmica 32, 474–506 (2002)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Patrick Healy
    • 1
  • Karol Lynch
    • 1
  1. 1.CSIS DepartmentUniversity of LimerickLimerickIreland

Personalised recommendations