DAG Drawing from an Information Visualization Perspective

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


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.\nThis 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.

Cite this document (BETA)

Available from ftp.cwi.nl
Page 1
Page 2

Authors on Mendeley

Readership Statistics

4 Readers on Mendeley
by Discipline
by Academic Status
25% Researcher (at a non-Academic Institution)
25% Researcher (at an Academic Institution)
25% Ph.D. Student
by Country
50% United Kingdom
25% Netherlands

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in