The readability of Path-Preserving Clusterings of Graphs

Daniel Archambault 1, 2 Helen Purchase 3 Bruno Pinaud 1, 4, *
* Auteur correspondant
1 GRAVITE - Graph Visualization and Interactive Exploration
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : 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.
Type de document :
Communication dans un congrès
G. Melançon and T. Munzner and D. Weiskopf. Eurovis 2010, 12th annual Eurographics/IEEE Symposium on Visualization, Jun 2010, Bordeaux, France. WILEY, 29(3), pp.1173-1182, 2010, Eurographics/ IEEE-VGTC Symposium on Visualization 2010; Special issue, EUROVIS 2010. <10.1111/j.1467-8659.2009.01683.x>
Liste complète des métadonnées


https://hal.inria.fr/inria-00471432
Contributeur : Bruno Pinaud <>
Soumis le : vendredi 6 août 2010 - 19:33:06
Dernière modification le : vendredi 11 septembre 2015 - 01:06:44
Document(s) archivé(s) le : lundi 8 novembre 2010 - 15:09:49

Fichier

hierarchyExperiment.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Daniel Archambault, Helen Purchase, Bruno Pinaud. The readability of Path-Preserving Clusterings of Graphs. G. Melançon and T. Munzner and D. Weiskopf. Eurovis 2010, 12th annual Eurographics/IEEE Symposium on Visualization, Jun 2010, Bordeaux, France. WILEY, 29(3), pp.1173-1182, 2010, Eurographics/ IEEE-VGTC Symposium on Visualization 2010; Special issue, EUROVIS 2010. <10.1111/j.1467-8659.2009.01683.x>. <inria-00471432>

Partager

Métriques

Consultations de
la notice

222

Téléchargements du document

238