The Readability of Path-Preserving Clusterings of Graphs
| dc.contributor.author | Archambault, Daniel | en_US |
| dc.contributor.author | Purchase, Helen C. | en_US |
| dc.contributor.author | Pinaud, Bruno | en_US |
| dc.contributor.editor | G. Melancon, T. Munzner, and D. Weiskopf | en_US |
| dc.date.accessioned | 2014-02-21T20:06:23Z | |
| dc.date.available | 2014-02-21T20:06:23Z | |
| dc.date.issued | 2010 | en_US |
| dc.description.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 extensive use of 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. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 29 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2009.01683.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2009.01683.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | The Readability of Path-Preserving Clusterings of Graphs | en_US |