Graphs, They Are Changing
Stephan Diehl,Carsten Görg +1 more
- pp 23-30
Reads0
Chats0
TLDR
A generic algorithm for drawing sequences of graphs that considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence.Abstract:
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 force-directed graph layout. Finally some results from our first prototype implementation are discussed.read more
Citations
More filters
Journal ArticleDOI
A Taxonomy and Survey of Dynamic Graph Visualization
TL;DR: A hierarchical taxonomy of techniques is derived by systematically categorizing and tagging publications and identifying the representation of time as the major distinguishing feature for dynamic graph visualizations.
Journal ArticleDOI
Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs
TL;DR: It is found that small multiples gave significantly faster performance than animation overall and for each of the authors' five graph comprehension tasks, and suggests that, for these two tasks, animation is preferable if accuracy is more important than speed.
Proceedings ArticleDOI
A system for graph-based visualization of the evolution of software
TL;DR: GEVOL extracts information about a Java program stored within a CVS version control system and displays it using a temporal graph visualizer, used by programmers to understand the evolution of a legacy program.
The State of the Art in Visualizing Dynamic Graphs
TL;DR: A hierarchical taxonomy of techniques is derived by systematically categorizing and tagging techniques in dynamic graph visualization and identifying the representation of time as the major distinguishing feature for dynamic graph visualizations.
Posted Content
Spring Embedders and Force Directed Graph Drawing Algorithms
TL;DR: This survey considers several classical algorithms for calculating layouts of simple undirected graphs, starting from Tutte's 1963 barycentric method and including recent scalable multiscale methods for large and dynamic graphs.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
A guide to the theory of np-completeness
TL;DR: This is the second edition of a quarterly column the purpose of which is to provide a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in the authors' book ‘‘Computers and Intractability: A Guide to the Theory of NP-Completeness’’.