Upward drawings of acyclic digraphs

  • Giuseppe Di Battista
  • Roberto Tamassia
Layout Of Graphs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 314)


The problem of representing acyclic digraphs in the plane is considered. We present algorithms that construct planar drawings of acyclic digraphs such that all edges are straight-line segments flowing in the same direction, e.g., from the left to the right or from the bottom to the top. The time complexity for constructing such upward drawings is O (n log n), where n is the number of vertices of the digraph. For covering digraphs of lattices (Hasse diagrams), the complexity is reduced to O(n). We also show that the planar digraphs that admit an upward drawing are exactly the subgraphs of planar st-graphs.


Planar Graph Candidate List Dual Graph Plane Representation Hasse Diagram 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Birkhoff, “Lattice Theory,” American Mathematical Society Colloquium Publications, vol. 25, 1979.Google Scholar
  2. [2]
    N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa, “A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees,” J. of Computer and System Sciences, vol. 30, no. 1, pp. 54–76, 1985.CrossRefGoogle Scholar
  3. [3]
    N. Chiba, K. Onoguchi, and T. Nishizeki, “Drawing Planar Graphs Nicely,” Acta Informatica, vol. 22, pp. 187–201, 1985.CrossRefGoogle Scholar
  4. [4]
    I. Fary, “On Straight Lines Representations of Planar Graphs,” Acta Sci. Math. Szeged, vol. 11, pp. 229–233, 1948.Google Scholar
  5. [5]
    B. Grunbaum and G. Shephard, “The Geometry of Planar Graphs,” Proc. 8th British Combinatorial Conf., pp. 124–150, 1981.Google Scholar
  6. [6]
    D. Kelly and I. Rival, “Planar Lattices,” Canadian J. Mathematics, vol. 27, no. 3, pp. 636–665, 1975.Google Scholar
  7. [7]
    D. Kelly, “On the Dimension of Partially Ordered Sets,” Discrete Mathematics, vol. 35, pp. 135–156, 1981.CrossRefGoogle Scholar
  8. [8]
    C. Platt, “Planar Lattices and Planar Graphs,” J. Combinatorial Theory, Series B, vol. 21, pp. 30–39, 1976.Google Scholar
  9. [9]
    R. Tamassia and I.G. Tollis, “A Unified Approach to Visibility Representations of Planar Graphs,” Discrete & Computational Geometry, vol. 1, no. 4, pp. 321–341, 1986.Google Scholar
  10. [10]
    C. Thomassen, “Planarity and Duality of Finite and Infinite Planar Graphs,” J. Combinatorial Theory, Series B, vol. 29, pp. 244–271, 1980.Google Scholar
  11. [11]
    C. Thomassen, “Plane Representations of Graphs,” in Progress in Graph Theory, J.A. Bondy and U.S.R. Murty (eds.), Academic Press, pp. 43–69, 1984.Google Scholar
  12. [12]
    W. Trotter and J. Moore Jr., “The Dimension of Planar Posets,” J. Combinatorial Theory, Series B, vol. 22, pp. 54–67, 1977.Google Scholar
  13. [13]
    W.T. Tutte, “Convex Representations of Graphs,” Proc. London Math Soc., vol. 10, pp. 304–320, 1960.Google Scholar
  14. [14]
    W.T. Tutte, “How to Draw a Graph,” Proc. London Math Soc., vol. 3, no. 13, pp. 743–768, 1963.Google Scholar
  15. [15]
    K. Wagner, “Bemerkungen zum Vierfarbenproblem,” Jber. Deutsch. Math.-Verein, vol. 46, pp. 26–32, 1936.Google Scholar
  16. [16]
    I. Yaglom and V. Boltyanskii, Convex Figures, Holt, Rinehart and Winston, 1961.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Giuseppe Di Battista
    • 1
  • Roberto Tamassia
    • 2
  1. 1.Dipartimento di Informatica e SistemisticaUniversity of Rome, “La Sapienza”RomeItaly
  2. 2.Coordinated Science LaboratoryUniversity of Illinois at Urbana-ChampaignUrbana

Personalised recommendations