Difference Map Readability for Dynamic Graphs [chapter]

Daniel Archambault, Helen C. Purchase, Bruno Pinaud
2011 Lecture Notes in Computer Science  
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
more » ... e 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. U. Brandes and S. Cornelsen (Eds.): GD
doi:10.1007/978-3-642-18469-7_5 fatcat:w6vtauy5uzevvaxyrzwbiq3uyu