Comparaison de la lisibilité des graphes en représentation noeuds-liens et matricielle - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

Comparaison de la lisibilité des graphes en représentation noeuds-liens et matricielle

Abstract

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.
No file

Dates and versions

hal-00343831 , version 1 (02-12-2008)

Identifiers

Cite

Mohammad Ghoniem, Jean-Daniel Fekete, Philippe Castagliola. Comparaison de la lisibilité des graphes en représentation noeuds-liens et matricielle. 16ème Conférence Francophone sur l'Interaction Homme-Machine, Sep 2004, Namur, Belgique. pp.77-84, ⟨10.1145/1148613.1148625⟩. ⟨hal-00343831⟩
198 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More