Graph compression - Save information by exploiting redundancy

Journal of Statistical Mechanics: Theory and Experiment

Volumn 2008, Issue 6, 2008, Pages

  Sun, Jie ^a   Bollt, Erik M ^a   Ben Avraham, Daniel ^a  

^a CLARKSON UNIVERSITY   (United States)

Author keywords

Networks; Random graphs

Indexed keywords

EID: 47649115421     PISSN: 17425468     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2008/06/P06001     Document Type: Article

References (13)

1. Watts D J and Strogatz S H 1998 Nature 393 440
2. Watts D J 1999 Small Worlds: The Dynamics of Networks between Order and Randomness (Princeton, NJ: Princeton University Press)
3. Barabasi A-L and Albert R 1999 Science 286 509
4. Albert R and Barabasi A-L 2002 Statistical mechanics of complex networks Rev. Mod. Phys. 74 47
5. http://en.wikipedia.org/wiki/Adjacency_matrix and http://en.wikipedia. org/wiki/Adjacency_list
6. Eisenstat S C, Elman H C, Schultz M H and Sherman A H 1984 The (new) Yale sparse matrix package Elliptic Problem Solvers II ed G Birkho and A Schoenstadt (New York: Academic) pp45-52
7. Eisenstat S C, Gursky M C, Schultz M H and Sherman A H 1982 Yale sparse matrix package I: the symmetric codes Int. J. Numer. Methods Eng. 18 1145
8. Tarjan R and Yao A 1971 Storing a sparse table Commun. ACM 22 606
9. Sun S, Ling L, Zhang N, Li G and Chen R 2003 Nucleic Acids Res. 31 2443
10. Duch J and Arenas A 2005 Phys. Rev. E 72 027104
11. Guimera R, Danon L, Diaz-Guilera A, Giralt F and Arenas A 2003 Phys. Rev. E 68 065103(R)
12. Batagelj V and Mrvar A 2006 Pajek datasets http://vlado.fmf.uni-lj.si/ pub/networks/data/
13. Bollobas B 2001 Random Graphs 2nd edn (Cambridge: Cambridge University Press)