The readability of path-preserving clusterings of graphs

Archambault, D., Purchase, H.C. and Pinaud, B. (2010) The readability of path-preserving clusterings of graphs. Computer Graphics Forum, 29(3), pp. 1173-1182. (doi:10.1111/j.1467-8659.2009.01683.x)

Full text not currently available from Enlighten.

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.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Purchase, Dr Helen
Authors: Archambault, D., Purchase, H.C., and Pinaud, B.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Computer Graphics Forum
ISSN:0167-7055

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