Difference Map Readability for Dynamic Graphs

Archambault, Daniel and Purchase, Helen C. and Pinaud, Bruno (2011) Difference Map Readability for Dynamic Graphs. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010 , pp. 50-61(Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_5).

Full text not available from this repository.


Difference maps are one way to show changes between timeslices in a dynamic graph. They highlight, using colour, the nodes and edges that were added, removed, or persisted between every pair of adjacent timeslices. Although some work has used difference maps for visualization, no user study has been performed to gauge their performance. In this paper, we present a user study to evaluate the effectiveness of difference maps in comparison with presenting the evolution of the dynamic graph over time on three interfaces. We found evidence that difference maps produced significantly fewer errors when determining the number of edges inserted or removed from a graph as it evolves over time. Also, difference maps were significantly preferred on all tasks.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-18469-7_5
Classifications: S Software and Systems > S.120 Visualization
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1193

Actions (login required)

View Item View Item