An algorithm for drawing general undirected graphs
Information Processing Letters
Using constraints to achieve stability in automatic graph layout algorithms
CHI '90 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Drawing graphs
Friendship Networks Through Time: An Actor-Oriented Dynamic Statistical Network Model
Computational & Mathematical Organization Theory
GD '95 Proceedings of the Symposium on Graph Drawing
A Bayesian Paradigm for Dynamic Graph Layout
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Visual unrolling of network evolution and the analysis of dynamic discourse
Information Visualization
Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
An Experimental Study on Distance-Based Graph Drawing
Graph Drawing
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
An efficient generator for clustered dynamic random networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
StreamEB: stream edge bundling
GD'12 Proceedings of the 20th international conference on Graph Drawing
Visualizing streaming text data with dynamic graphs and maps
GD'12 Proceedings of the 20th international conference on Graph Drawing
Mental map preservation helps user orientation in dynamic graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Clustering, visualizing, and navigating for large dynamic graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
A regularized graph layout framework for dynamic network visualization
Data Mining and Knowledge Discovery
Spectral embedding for dynamic social networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
The "Map" in the mental map: Experimental results in dynamic graph drawing
International Journal of Human-Computer Studies
| Hi-index | 0.00 |
In dynamic graph drawing, the input is a sequence of graphs for which a sequence of layouts is to be generated such that the quality of individual layouts is balanced with layout stability over time. Qualitatively different extensions of drawing algorithms for static graphs to the dynamic case have been proposed, but little is known about their relative utility. We report on a quantitative study comparing the three prototypical extensions via their adaptation for the stress-minimization framework. While some findings are more subtle, the linking approach connecting consecutive instances of the same vertex is found to be the overall method of choice.