Skip to content

References

Jump to bottom Edit New page
Alberto Cottica edited this page Sep 10, 2015 · 2 revisions

  1. Melancon, G. (2006, May). Just how dense are dense graphs in the real world?: a methodological note. In Proceedings of the 2006 AVI workshop on Beyond time and errors: novel evaluation methods for information visualization (pp. 1-7). ACM. This paper claims that networks become difficult to read when the edge density (number of edges/number of nodes) exceeds 4.

  2. Nick, Bobo, et al. "Simmelian backbones: amplifying hidden homophily in facebook networks." Advances in Social Networks Analysis and Mining (ASONAM), 2013 IEEE/ACM International Conference on. IEEE, 2013. This paper explains what the Simmelian backbone is, and how to compute it.

Add a custom footer
Add a custom sidebar
Clone this wiki locally