Difference map readability for dynamic graphs

Archambault, D., Purchase, H.C. and Pinaud, B. (2011) Difference map readability for dynamic graphs. In: Brandes, U. and Cornelsen, S. (eds.) Graph Drawing : 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Springer. ISBN 9783642184680

Full text not currently available from Enlighten.


Difference maps are one way to show changes between times- lices 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 differ- ence 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:Book Sections
Glasgow Author(s) Enlighten ID:Purchase, Dr Helen
Authors: Archambault, D., Purchase, H.C., and Pinaud, B.
Subjects:Q Science > QA Mathematics
College/School:College of Science and Engineering > School of Computing Science

University Staff: Request a correction | Enlighten Editors: Update this record