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.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00091354
Contributor : Guy Melançon <>
Submitted on : Wednesday, September 6, 2006 - 9:11:00 AM
Last modification on : Thursday, May 24, 2018 - 3:59:21 PM
Long-term archiving on : Thursday, September 20, 2012 - 10:20:10 AM

Identifiers

  • HAL Id : lirmm-00091354, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

230

Files downloads

838