Conference proceedings

DAG Drawing from an Information Visualization Perspective

Melançon G, Herman I, van Liere R, de Leeuw W ...see all

Published by Springer-Verlag

  • 4


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.
Sign in to save reference


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 made 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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links


  • G. Melançon

  • I. Herman

  • R. van Liere

  • W. de Leeuw

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free