, Volume 12, Issue 2, pp 109–133

Upward planarity testing

  • Ashim Garg
  • Roberto Tamassia

DOI: 10.1007/BF01108622

Cite this article as:
Garg, A. & Tamassia, R. Order (1995) 12: 109. doi:10.1007/BF01108622


Acyclic digraphs, such as the covering digraphs of ordered sets, are usually drawn upward, i.e., with the edges monotonically increasing in the vertical direction. A digraph is upward planar if it admits an upward planar drawing. In this survey paper, we overview the literature on the problem of upward planarity testing. We present several characterizations of upward planarity and describe upward planarity testing algorithms for special classes of digraphs, such as embedded digraphs and single-source digraphs. We also sketch the proof of NP-completeness of upward planarity testing.

Mathemtics Subject Classifications (1991)

05C10 06A99 68Q20 68R10 68U05 

Key words

Graph drawing ordered set lattice upward planarity NP-completeness directed acyclic graph 

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Ashim Garg
    • 1
  • Roberto Tamassia
    • 1
  1. 1.Department of Computer ScienceBrown UniversityProvidenceU.S.A.

Personalised recommendations