Graphs, They Are Changing [chapter]

Stephan Diehl, Carsten Görg
2002 Lecture Notes in Computer Science  
In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. We introduce several general adjustment strategies and give examples of these strategies in the context of
more » ... orce-directed graph layout. Finally some results from our first prototype implementation are discussed.
doi:10.1007/3-540-36151-0_3 fatcat:632djjebard5bph2yzst7v2luq