On the Readability of Graphs Using Node-Link and Matrix-Based Representations: A Controlled Experiment and Statistical Analysis
- 1 June 2005
- journal article
- research article
- Published by SAGE Publications in Information Visualization
- Vol. 4 (2) , 114-135
Abstract
In this article, we describe a taxonomy of generic graph related tasks along with a computer-based evaluation designed to assess the readability of two representations of graphs: matrix-based representations and node-link diagrams. This evaluation encompasses seven generic tasks and leads to insightful recommendations for the representation of graphs according to their size and density. Typically, we show that when graphs are bigger than twenty vertices, the matrix-based visualization outperforms node-link diagrams on most tasks. Only path finding is consistently in favor of node-link diagrams throughout the evaluation.Keywords
This publication has 7 references indexed in Scilit:
- A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations2005
- The effects of graph layout2002
- Empirical Evaluation of Aesthetics-based Graph LayoutEmpirical Software Engineering, 2002
- Cognitive Measurements of Graph AestheticsInformation Visualization, 2002
- Graph visualization and navigation in information visualization: A surveyIEEE Transactions on Visualization and Computer Graphics, 2000
- An experimental study of the basis for graph drawing algorithmsACM Journal of Experimental Algorithmics, 1997
- Visualizing network dataIEEE Transactions on Visualization and Computer Graphics, 1995