Just how dense are dense graphs in the real world? A methodological note - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2006

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.
Fichier principal
Vignette du fichier
BELIV_2006_Melancon_Final.pdf (1.66 Mo) Télécharger le fichier
Loading...

Dates and versions

lirmm-00091354 , version 1 (06-09-2006)

Identifiers

  • HAL Id : lirmm-00091354 , version 1

Cite

Guy Melançon. Just how dense are dense graphs in the real world? A methodological note. BELIV 2006: BEyond time and errors: novel evaLuation methods for Information Visualization (AVI Workshop), May 2006, Venice, Italy, pp.75-81. ⟨lirmm-00091354⟩
128 View
1237 Download

Share

Gmail Facebook X LinkedIn More