On the Readability of Graphs Using Node-Link and Matrix-Based Representations: A Controlled Experiment and Statistical Analysis

By M. Ghoniem, Jean-Daniel Fekete, Philippe Castagliola. Information Visualization, 2005

371 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

MatrixExplorer: a Dual-Representation System to Explore Social Networks (2006, background): “Ghoniem et al. [ 18 ] showed that matrices outperform node-link diagrams for large graphs or dense graphs in several low-level reading tasks, except path finding.”
NodeTrix: a Hybrid Visualization of Social Networks (2007, background): “However, it is ill-suited to path-related tasks [13] that are very important in social network analysis.”
Hierarchical Aggregation for Information Visualization: Overview, Techniques, and Design Guidelines (2010, background): “Adjacency matrices have been shown to be more efficient than node-link diagrams for large and/or dense graphs [40], and are, thus, often employed for visualizing large graphs, either alone or in tandem [45] with node-link diagrams.”
ASK-GraphView: A Large Scale Graph Visualization System (2006, positive): “Also, these views did not allow inspection of fine graph details and their relationships to the rest of the graph.”