Revisited experimental comparison of node-link and matrix representations

DOI10.1007/978-3-319-73915-1_23MaRDI QIDQ4625118zbMATH OpenOpenAlexFDO

Authors Mershack Okoe, Radu Jianu, Stephen G. Kobourov

Publication date 20 February 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1709.00293, https://openaccess.city.ac.uk/id/eprint/19215/1/node-link-diagrams%20%281%29.pdf

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Abstract: Visualizing network data is applicable in domains such as biology, engineering, and social sciences. We report the results of a study comparing the effectiveness of the two primary techniques for showing network data: node-link diagrams and adjacency matrices. Specifically, an evaluation with a large number of online participants revealed statistically significant differences between the two visualizations. Our work adds to existing research in several ways. First, we explore a broad spectrum of network tasks, many of which had not been previously evaluated. Second, our study uses a large dataset, typical of many real-life networks not explored by previous studies. Third, we leverage crowdsourcing to evaluate many tasks with many participants.

Recommendations

• scientific article; zbMATH DE number 1982193
• Evaluating Visualizations of Sets and Networks that Use Euler Diagrams and Graphs
• Controllable and Progressive Edge Clustering for Large Networks
• Visualization of citation networks for large science portals
• Data visualization through their graph representations

Cites work

• scientific article; zbMATH DE number 2084318 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• Public Key Cryptography - PKC 2005
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Smooth projective hashing and two-message oblivious transfer

Cited in

(3)

• Turning cliques into paths to achieve planarity
• A user study on hybrid graph visualizations
• On time and space: an experimental study on graph structural and temporal encodings

This page was built for publication: Revisited experimental comparison of node-link and matrix representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625118)