Dynamic Graph Drawing: 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.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Martí, Rafael; Martínez-Gavara, Anna; Sánchez-Oro, Jesús; Duarte, Abraham: Tabu search for the dynamic bipartite drawing problem (2018)
- Crnovrsanin, Tarik; Chu, Jacqueline; Ma, Kwan-Liu: An incremental layout method for visualizing online dynamic graphs (2017)
- Skambath, Malte; Tantau, Till: Offline drawing of dynamic trees: algorithmics and document integration (2016)
- John, Mathias; Schulz, Hans-Jörg; Schumann, Heidrun; Uhrmacher, Adelinde M.; Unger, Andrea: Constructing and visualizing chemical reaction networks from pi-calculus models (2013)
- Görg, Carsten; Birke, Peter; Pohl, Mathias; Diehl, Stephan: Dynamic graph drawing of sequences of orthogonal and hierarchical graphs (2005)
- Diehl, Stephan; Görg, Carsten: Graphs, they are changing. Dynamic graph drawing for a sequence of graphs (2002)
- Diehl, Stephan; Görg, Carsten; Kerren, Andreas: Preserving the mental map using foresighted layout (2001)