Upward planarity testing of outerplanar dags (extended abstract)

  • Achilleas Papakostas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)


In this paper, we present two polynomial-time algorithms to determine if an outerplanar directed acyclic graph (odag) can be drawn upward planar, that is, drawn in planar straight-line fashion so that all arcs point up. The first algorithm checks if the odag has an upward planar drawing that is topologically equivalent to the outerplanar embedding of the odag. This algorithm runs in linear time (which is optimal), and is faster than any previous algorithm known. The second algorithm also checks whether an odag has an upward planar drawing but does not insist that the drawing be topologically equivalent to the outerplanar embedding. This is the first polynomial-time algorithm we know of to solve this problem.


Planar Graph Linear Time Directed Acyclic Graph Condition Graph Algorithm Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    P. Bertolazzi and G. Di Battista, On upward drawing testing of triconnected digraphs, Proc. 7th ACM Symp. on Computational Geometry, pp. 272–280, 1991.Google Scholar
  2. 2.
    P. Bertolazzi, G. Di Battista, C. Mannino and R. Tamassia, Optimal upward planarity testing of single-source digraphs, In 1st Annual European Symp. on Algorithms, Lecture Notes in Comp. Sci., Springer-Verlag, 1993.Google Scholar
  3. 3.
    G. Di Battista, W.P. Liu, I. Rival, Bipartite graphs, Upward drawings and Planarity, Information Processing Letters, vol. 36, pp. 317–322, 1990.Google Scholar
  4. 4.
    G. Di Battista and R. Tamassia, Algorithms for plane representations of acyclic digraphs, Theoretical Computer Science, vol. 61, pp. 175–198, 1988.Google Scholar
  5. 5.
    H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica, vol. 10, pp. 41–51, 1990.Google Scholar
  6. 6.
    A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, to appear in Proc. of Graph Drawing 1994.Google Scholar
  7. 7.
    J. Hopcroft and R. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach., vol. 21, pp. 549–568, 1974.Google Scholar
  8. 8.
    M.D. Hutton and A. Lubiw, Upward planar drawing of single source acyclic digraphs, Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pp. 203–211, 1990.Google Scholar
  9. 9.
    D. Kelly, On the dimension of partially ordered sets, Discrete Math., vol. 63, pp. 197–216, 1987.Google Scholar
  10. 10.
    C. Platt, Planar lattices and planar graphs, J. Combin. Theory Ser. B, vol. 21, pp. 30–39, 1976.Google Scholar
  11. 11.
    W. Schnyder, Embedding planar graphs on the grid, Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, pp. 138–147, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Achilleas Papakostas
    • 1
  1. 1.Department of Computer ScienceThe University of Texas at DallasRichardson

Personalised recommendations