Drawing Dynamic Graphs Without Timeslices
From MaRDI portal
Publication:4625131
DOI10.1007/978-3-319-73915-1_31zbMath1503.68234arXiv1709.00372OpenAlexW2751016934MaRDI QIDQ4625131
Paolo Simonetto, Stephen G. Kobourov, Daniel Archambault
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.00372
Computer science aspects of computer-aided design (68U07) Graph theory (including graph drawing) in computer science (68R10)
Related Items (3)
On time and space: an experimental study on graph structural and temporal encodings ⋮ Visualizing evolving trees ⋮ HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs
Cites Work
- Are Crossings Important for Drawing Large Graphs?
- A Sparse Stress Model
- Difference Map Readability for Dynamic Graphs
- A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing
- Mental Map Preservation Helps User Orientation in Dynamic Graphs
- Clustering, Visualizing, and Navigating for Large Dynamic Graphs
- Graph Drawing
- Graph Drawing
- An Incremental Layout Method for Visualizing Online Dynamic Graphs
- Graph Drawing
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Drawing Dynamic Graphs Without Timeslices