An experimental study of the basis for graph drawing algorithms
Journal of Experimental Algorithmics (JEA)
Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
IEEE Transactions on Visualization and Computer Graphics
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
Visualisation de graphes de co-activité par matrices d'adjacence
IHM '02 Proceedings of the 14th French-speaking conference on Human-computer interaction (Conférence Francophone sur l'Interaction Homme-Machine)
Volume upper bounds for 3D graph drawing
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
OZCHI '98 Proceedings of the Australasian Conference on Computer Human Interaction
Cognitive measurements of graph aesthetics
Information Visualization
Using multilevel call matrices in large software projects
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Mat'Graph: transformation matricielle de graphe pour visualiser des échanges électroniques
IHM 2005 Proceedings of the 17th international conference on Francophone sur l'Interaction Homme-Machine
Just how dense are dense graphs in the real world?: a methodological note
Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization
Visualisation hybride des liens hiérarchiques incorporant des treemaps dans une matrice d'adjacence
Proceedings of the 21st International Conference on Association Francophone d'Interaction Homme-Machine
| Hi-index | 0.00 |
This article describes a taxonomy of tasks on graphs and a controlled experiment for assessing the readability of two graph representations: matrices and node-link diagrams. The experiment only concerned a subset of the described tasks but provides important insights on the use of representations depending on the graph sizes and densities. It shows that, for graphs larger than 20 nodes or sufficiently dense, most tasks are performed more efficiently on the matrix-based representation. Only some path related tasks score better on node-link diagrams.