Difference map readability for dynamic graphs

Daniel Archambault, Helen C. Purchase, Bruno Pinaud

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

31 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationGraph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers
Number of pages12
ISBN (Print)9783642184680
Publication statusPublished - 2011
Externally publishedYes
EventGraph Drawing 2010 - Konstanz, Germany
Duration: 21 Sept 201024 Sept 2010
Conference number: 18th
https://link.springer.com/book/10.1007/978-3-642-18469-7 (Proceedings)

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6502 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceGraph Drawing 2010
Abbreviated titleGD 2010
Internet address

Cite this