Dynamic Graph Drawing

By graph animation we denote the problem of drawing known sequences of graphs. The graphs in such a sequence usually have evolved by adding and deleting edges and nodes. Drawing such graphs results in an additional aesthetic criterium known as "preserving the mental map" or dynamic stability. We investigate generic algorithms to draw such graph sequences as well as metrics for dynamic stability.



The Nevada-system (Network Visualization and Analysis for Dynamic Networks) is an open-source system that creates offline animations of a sequence of graphs. Currently three different layout paradigms are implemented: Force-directed, hierarchic and orthogonal layout. Furthermore it supports analysis methods like visual mapping of centrality measures.

The open-source version of nevada is available at nevada's sourceforge site.


  • Mathias Pohl and Peter Birke: Interactive Exploration of Large Dynamic Networks, VISUAL 2008, Salerno, Italy. LNCS 5188, Springer.
  • Mathias Pohl, Florian Reitz, and Peter Birke: As Time Goes by - Integrated Visualization and Analysis of Dynamic Networks, AVI 2008 - Advanced Visual Interfaces, Naples, Italy. ACM Press 2008.
  • Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
    Carsten Görg, Peter Birke, Mathias Pohl, and Stephan Diehl. 
    In Proceedings of 12th International Symposium on Graph Drawing, New York City, USA, September 29 - October 2, 2004.
  • Graphs, They are Changing - Dynamic Graph Drawing for a Sequence of Graphs
    Stephan Diehl and Carsten Görg
    in Proceedings of 10th International Symposium on Graph Drawing, Irvine, California, August 26-28, 2002.
  • Animating Algorithms Live and Post Mortem
    Stephan Diehl, Carsten Görg and Andreas Kerren
    in "Software Visualization", State-of-the-Art Survey, Springer LNCS 2269, 2002.
  • Preserving the Mental Map using Foresighted Layout
    Stephan Diehl, Carsten Görg and Andreas Kerren
    in Proceedings of Joint Eurographics - IEEE TCVG Symposium on Visualization, VisSym 2001, Ascona, Switzerland, Springer Verlag, 2001.
  • Foresighted Graphlayout
    Stephan Diehl, Carsten Görg and Andreas Kerren
    Technischer Bericht A 02/00, FB Informatik, University Saarbruecken