Advertisement

How to draw a series-parallel digraph

Extended abstract
  • P. Bertolazzi
  • R. F. Cohen
  • G. Di Battista
  • R. Tamassia
  • I. G. Tollis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 621)

Abstract

Upward and dominance drawings of acyclic digraphs find important applications in the display of hierarchical structures such as PERT diagrams, subroutine-call charts, and is-a relationships. The combinatorial model underlying such hierarchical structures is often a series-parallel digraph. In this paper the problem of constructing upward and dominance drawings of series-parallel digraphs is investigated. We show that the area requirement of upward and dominance drawings of series-parallel digraphs crucially depends on the choice of planar embedding. Also, we present parallel and sequential drawing algorithms that are optimal with respect to both the time complexity and to the area achieved. Our results show that while series-parallel digraphs have a rather simple and well understood combinatorial structure, naive drawing strategies lead to drawings with exponential area, and clever algorithms are needed to achieve optimal area.

Keywords

Planar Graph Parallel Composition Decomposition Tree Series Composition Planar Embedding 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Bertolazzi and G. Di Battista, “On Upward Drawing Testing of Triconnected Digraphs,” Proc. 7th ACM Symp. on Computational Geometry, 1991.Google Scholar
  2. [2]
    R. Cohen, G. Di Battista, R. Tamassia, I.G. Tollis, and P. Bertolazzi, “A Framework for Dynamic Graph Drawing,” Proc. 8th ACM Symp. on Computational Geometry, 1992.Google Scholar
  3. [3]
    H. de Fraysseix, J. Pach, and R. Pollack, “Small Sets Supporting Fary Embeddings of Planar Graphs,” Proc. 20th ACM Symp. on Theory of Computing, 1988.Google Scholar
  4. [4]
    G. Di Battista, W.P. Liu, and I. Rival, “Bipartite Graphs, Upward Drawings, and Planarity,” Information Processing Letters, 36, 317–322, 1990.Google Scholar
  5. [5]
    G. Di Battista, E. Pietrosanti, R. Tamassia, and I.G. Tollis, “Automatic Layout of PERT Diagrams with X-PERT,” Proc. IEEE Workshop on Visual Languages, 1989.Google Scholar
  6. [6]
    G. Di Battista and R. Tamassia, “Algorithms for Plane Representations of Acyclic Digraphs,” Theoretical Computer Science, 61, 175–198, 1988.Google Scholar
  7. [7]
    G. Di Battista, R. Tamassia, and I.G. Tollis, “Area Requirement and Symmetry Display in Drawing Graphs,” Proc. 5th ACM Symp. on Computational Geometry, 1989. To appear in Discrete & Computational Geometry.Google Scholar
  8. [8]
    P. Eades and R. Tamassia, “Algorithms for Drawing Graphs: an Annotated Bibliograpy,” Tech. Report CS-89-09, Brown Univ., 1989.Google Scholar
  9. [9]
    P. Eades and L. Xuemin, “How to Draw a Directed Graph,” Proc. IEEE Workshop on Visual Languages, 1989.Google Scholar
  10. [10]
    S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979.Google Scholar
  11. [11]
    A. Gibbons and W. Rytter, “An Optimal Parallel Algorithm for Dynamic Expression Evaluation and its Applications,” Proc. Symp. on Foundation of Software Technology and Theoretical Computer Science, 1986.Google Scholar
  12. [12]
    M.D. Hutton, A. Lubiw, “Upward Planar Drawing of Single Source Acyclic Digraphs,” Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, 1990.Google Scholar
  13. [13]
    T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics, North Holland, 1988.Google Scholar
  14. [14]
    W. Schnyder, “Embedding Planar Graphs on the Grid,” Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, 1990.Google Scholar
  15. [15]
    K. Sugiyama, S. Tagawa, and M. Toda, “Methods for Visual Understanding of Hierarchical Systems,” IEEE Trans. on Systems, Man, and Cybernetics, SMC-11, 109–125, 1981.Google Scholar
  16. [16]
    R. Tamassia, G. Di Battista, and C. Batini, “Automatic Graph Drawing and Readability of Diagrams,” IEEE Trans. on Systems, Man, and Cybernetics, SMC-18, 61–79, 1988.Google Scholar
  17. [17]
    R. Tamassia and I.G. Tollis, “A Unified Approach to Visibility Representations of Planar Graphs,” Discrete & Comput. Geometry, 1, 321–341, 1986.Google Scholar
  18. [18]
    R.E. Tarjan and U. Vishkin, “Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time”, SIAM J. on Computing, 1985.Google Scholar
  19. [19]
    J. Valdes, R.E. Tarjan, and E.L. Lawler, “The Recognition of Series-Parallel Digraphs,” SIAM J. on Computing, 11, 298–313, 1982.Google Scholar
  20. [20]
    C. Thomassen, “Planar Acyclic Oriented Graphs,” Order, 5, 349–361, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • P. Bertolazzi
    • 1
  • R. F. Cohen
    • 2
  • G. Di Battista
    • 3
  • R. Tamassia
    • 2
  • I. G. Tollis
    • 4
  1. 1.IASI - CNRRomeItaly
  2. 2.Department of Computer ScienceBrown UniversityProvidence
  3. 3.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomeItaly
  4. 4.Department of Computer ScienceThe University of Texas at DallasRichardson

Personalised recommendations