Just how dense are dense graphs in the real world? A methodological note

Abstract : This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an effort to prove the robustness or superiority of a novel graph visualization technique. We survey many real world examples all being of equal interest in Information Visualization, and draw a list of conclusions on how to tune edge density when randomly generating graphs in order to build artificial though realistic examples.
Type de document :
Communication dans un congrès
Enrico Bertini, Catherine Plaisant, Giuseppe Santucci. BELIV 2006: BEyond time and errors: novel evaLuation methods for Information Visualization (AVI Workshop), May 2006, Venice, Italy, ACM, pp.75-81, 2006
Liste complète des métadonnées

Littérature citée [30 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00091354
Contributeur : Guy Melançon <>
Soumis le : mercredi 6 septembre 2006 - 09:11:00
Dernière modification le : jeudi 11 janvier 2018 - 06:14:31
Document(s) archivé(s) le : jeudi 20 septembre 2012 - 10:20:10

Identifiants

  • HAL Id : lirmm-00091354, version 1

Collections

Citation

Guy Melançon. Just how dense are dense graphs in the real world? A methodological note. Enrico Bertini, Catherine Plaisant, Giuseppe Santucci. BELIV 2006: BEyond time and errors: novel evaLuation methods for Information Visualization (AVI Workshop), May 2006, Venice, Italy, ACM, pp.75-81, 2006. 〈lirmm-00091354〉

Partager

Métriques

Consultations de la notice

165

Téléchargements de fichiers

571