Table 2 Results comparing the encoded graph \(G_c\) to the compressed \(f(G_c)\)
From: GraphZIP: a clique-based sparse graph compression method
Graph | Space savings, \(S_c = 1 - \frac{G_c}{G}\) | |
|---|---|---|
Encoded graph, \(G_c\) | Compressed, \(f(G_c)\) | |
ia-enron-only | 27.07 | 69.94 |
ia-infect-dub. | 35.69 | 79.90 |
ia-email-univ | 22.60 | 79.34 |
bio-DD21 | 37.51 | 80.72 |
ca-HepPh | 57.69 | 89.49 |
ca-AstroPh | 32.89 | 65.89 |
ca-CondMat | 30.58 | 80.46 |
web-google | 46.99 | 81.42 |
web-BerkStan | 31.87 | 86.55 |
web-sk-2005 | 50.03 | 92.60 |
web-indochina | 64.61 | 94.23 |
soc-gplus | 27.40 | 92.36 |
hamming6-2 | 53.15 | 90.59 |
hamming8-2 | 51.03 | 96.32 |
c-fat200-1 | 56.17 | 84.57 |
chesapeake | 27.63 | 58.94 |