The readability of Path-Preserving Clusterings of Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Graphics Forum Year : 2010

The readability of Path-Preserving Clusterings of Graphs


Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving way based on attribute values associated with the nodes of the graph. Despite the extensive use these representations, as far as we know, no formal experimentation exists to evaluate if they improve the readability of graphs. In this paper, we present the results of a user study that formally evaluates how such representations affect the readability of graphs. We also explore the effect of graph size and connectivity in terms of this primary research question. Overall, for our tasks, we did not find a significant difference when this clustering is used. However, if the graph is highly connected, these clusterings can improve performance. Also, if the graph is large enough and can be simplified into a few metanodes, benefits in performance on global tasks are realized. Under these same conditions, however, performance of local attribute tasks may be reduced.


Other [cs.OH]
Fichier principal
Vignette du fichier
hierarchyExperiment.pdf (2.99 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00471432 , version 1 (06-08-2010)



Daniel Archambault, Helen Purchase, Bruno Pinaud. The readability of Path-Preserving Clusterings of Graphs. Computer Graphics Forum, 2010, 29 (3), pp.1173-1182. ⟨10.1111/j.1467-8659.2009.01683.x⟩. ⟨inria-00471432⟩
158 View
330 Download



Gmail Facebook Twitter LinkedIn More