A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing

DOI10.1007/978-3-642-25878-7_11zbMath1311.68106MaRDI QIDQ3223947

Martin Mader, Ulrik Brandes

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_11

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Drawing Dynamic Graphs Without Timeslices, Stochastic Gradient Descent Works Really Well for Stress Minimization, On time and space: an experimental study on graph structural and temporal encodings, Visualizing evolving trees, A regularized graph layout framework for dynamic network visualization, Visualizing the effects of a changing distance on data using continuous embeddings, Evaluation of Two Interaction Techniques for Visualization of Dynamic Graphs

Uses Software

• GraphAEL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Friendship networks through time: An actor-oriented dynamic statistical network model
• An algorithm for drawing general undirected graphs
• Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
• An Experimental Study on Distance-Based Graph Drawing
• Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
• Graph Drawing
• Random Graphs
• Graph Drawing