Order

, Volume 12, Issue 2, pp 109–133

Upward planarity testing

Authors

  • Ashim Garg
    • Department of Computer ScienceBrown University
  • Roberto Tamassia
    • Department of Computer ScienceBrown University
Article

DOI: 10.1007/BF01108622

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

Abstract

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)

05C1006A9968Q2068R1068U05

Key words

Graph drawingordered setlatticeupward planarityNP-completenessdirected acyclic graph

Copyright information

© Kluwer Academic Publishers 1995