DAG Drawing from an Information Visualization Perspective

  • G. Melançon
  • I. Herman
Part of the Eurographics book series (EUROGRAPH)


When dealing with a graph, any visualization strategy must rely on a layout procedure at least to initiate the process. Because the visualization process evolves within an interactive environment the choice of this layout procedure is critical and will often be based on efficiency.

This paper compares two popular layout strategies, one based on the extraction of a spanning tree, the other based on edge crossing minimization of directed acyclic graphs. The comparison is based on a large number of experimental evidence gathered through random graph generation. The main conclusion of these experiments is that, contrary to the popular belief, usage of edge crossing minimization algorithms may be extremely useful and advantageous, even under the heavy requirements of information visualization.


Span Tree Directed Acyclic Graph Edge Density Information Visualization Graph Visualization 
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.
    di Battista, G., Eades, P., Tamassia, R., and Tollis, I.G. Graph Drawing: Algorithms for the Visualisation of Graphs. Prentice Hall, 1999Google Scholar
  2. 2.
    Eades, P. and Whitesides, S.H. Drawing Graphs in Two Layers. Theoretical Computer Science, 131(2) 361–374, 1994.MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    . Gansner, E.R., North, S.C., and Vo, K.P. DAG - A Program that Draws Directed Graphs. Software: Practice and Experience, 18(11) 1047–1062 1988.MATHCrossRefGoogle Scholar
  4. 4.
    Garey, M.R. and Johnson, D.S. Crossing number is NP-complete. SIAM Journal ofAlgebraic and Discrete Methods, 4(3)312–316, 1983.MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Herman I., Marshall M.S., and Melanin G. An Object-Oriented Design for Graph Visualization. Technical Report INS-0001, Centrum voor Wiskunde en Informatica (CWI), 2000. See f t p : //ftp/cwi /n1/pub/ CWI reports/INS.Google Scholar
  6. 6.
    Herman I., Marshall M.S., and Melangon G. Graph Visualization and Navigation in Information Visualization. IEEE Transactions on Visualization and Computer Graphics, 6, 2000 (to appear).Google Scholar
  7. 7.
    Juenger, M. and Mutzel, P. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications, 1(25) 33–59 1997.Google Scholar
  8. 8.
    Jungnickel, D. Graphs, Networks and Algorithms. Springer, 1999.Google Scholar
  9. 9.
    Melancon G., Dutour I., and Bousquet-Mélou M. Random generation of Dags for Graph Drawing. Technical Report INS-0005, Centrum voor Wiskunde en Informatica (CWI), 2000. See f t p : //ftp/cwi/n1/pub/CWI reports/INS.Google Scholar
  10. 10.
    Munzner, T. H3: Laying out Large Directed Graphs in 3D Hyperbolic Space. In IEEE Symposium on Information Visualization (InfoVis ’97), pages 2–10. IEEE CS Press, 1997.Google Scholar
  11. 11.
    Munzner, T. Drawing Large Graphs with H3Viewer and Site Manager. In Symposium on Graph Drawing GD ’98, Lecture Notes in Computer Science, pages 384–393. Springer-Verlag, 1998.Google Scholar
  12. 12.
    Purchase, H., Cohen, R.F., and James, M. Validating Graph Drawing Aesthetics. In Symposium Graph Drawing GD’95, volume 1027 of Lectures Notes in Computer Science, pages 435–446. Springer-Verlag, 1995.Google Scholar
  13. 13.
    Purchase, H.C. Which aesthetic has the greatest effect on human understanding? In Symposium on Graph Drawing GD ’97, Lecture Notes in Computer Science, pages 248-261. Springer-Verlag, 1998.Google Scholar
  14. 14.
    Reingold, E.M. and Tilford, J.S. Tidier Drawing of Trees. IEEE Transactions on Software Engineering, 7(2)223–228, 1981.CrossRefGoogle Scholar
  15. 15.
    Walker, J.Q. A Node-positioning Algorithm for General Trees. Software: Practice and Experience, 20(7)685–705 1990.CrossRefGoogle Scholar
  16. 16.
    Wills, G.J. Niche Works - Interactive Visualization of Very Large Graphs. In Symposium on Graph Drawing GD’97, volume 1353 of Lectures Notes in Computer Science, pages 403–414. Springer, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • G. Melançon
    • 1
  • I. Herman
    • 1
  1. 1.Centrum voor Wiskunde en Informatica (CWI)AmsterdamThe Netherlands

Personalised recommendations