Graph Compression by BFS

Algorithms

Volumn 2, Issue 3, 2009, Pages 1031-1044

  Apostolico, Alberto ^a,b   Drovandi, Guido ^c,d  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

^c ROMA TRE UNIVERSITY   (Italy)

^d CNR   (Italy)

Author keywords

Breadth first search; Data compression; Graph compression; Universal codes; Web graph

Indexed keywords

EID: 77956196952     PISSN: None     EISSN: 19994893     Source Type: Journal    
DOI: 10.3390/a2031031     Document Type: Article

References (20)

1. Adler, M.; Mitzenmacher, M. Towards compressing web graphs. In Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, USA, March 27-29, 2001; pp. 203-212.
2. Asano, Y.; Miyawaki, Y.; Nishizeki, T. Efficient compression of web graphs. In Proceedings of the 14th annual international conference on Computing and Combinatorics, Dalian, China, June 27-29, 2008; Springer-Verlag: Berlin, Heidelberg, Germany, 2008, pp. 1-11.
3. Boldi, P.; Vigna, S. The web graph framework I: Compression techniques. In Proceedings of the Thirteenth International World Wide Web Conference, New York, NY, USA, 2004; ACM Press: Manhattan, USA, 2004, pp. 595-601.
4. Claude, F.; Navarro, G. A fast and compact web graph representation. In Proceedings of 14th International Symposium on String Processing and Information Retrieval, Santiago, Chile, October 29-31, 2007; pp. 105-116.
5. Randall, K.H.; Stata, R.; Wiener, J.L.; Wickremesinghe, R.G. The link database: fast access to graphs of the web. In Proceedings of the Data Compression Conference (DCC '02), Snowbird, UT, USA, April 2-4, 2002; IEEE Computer Society: Washington, DC, USA, 2002;, p. 122.
6. Suel, T.; Yuan, J. Compressing the graph structure of the web. In Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, USA, March 27-29, 2001; pp. 213-222.
7. Buehrer, G.; Chellapilla, K. A scalable pattern mining approach to web graph compression with communities. In Proceedings of the international conference on Web search and web data mining, Palo Alto, CA, USA, February 11-12, 2008; ACM: New York, NY, USA, 2008; pp. 95-106.
8. Boldi, P.; Codenotti, B.; Santini, M.; Vigna, S. UbiCrawler: a scalable fully distributed web crawler. Software: Pract. Exp. 2004, 34, 711-726.
9. Turan, G. On the succinct representation of graphs. Discrete Appl. Math. 1984, 8, 289-294.
10. Feder, T.; Motwani, R. Clique partitions, graph compression and speeding-up algorithms. J. Comput. Syst. Sci. 1995, 51, 261-272.
11. Boldi, P.; Vigna, S. Codes for the world wide web. Internet Math. 2005, 2, 407-429.
12. Larsson, N.J.; Moffat, A. Offline dictionary-based compression. IEEE 2000, 88, 1722-1732.
13. Karande, C.; Chellapilla, K.; Andersen, R. Speeding up algorithms on compressed web graphs. In Proceedings of the Second ACM International Conference on Web Search and Data Mining, Barcelona, Spain, February 9-12, 2009; ACM: New York, NY, USA, 2009; pp. 272-281.
14. Brin, S.; Page, L. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 1998, 30, 107-117.
15. Page, L.; Brin, S.; Motwani, R.; Winograd, T. The pagerank citation ranking: bringing order to the web; Technical Report 1999-66; Stanford InfoLab, 1999; Previous number = SIDL-WP-1999-0120.
16. Chierichetti, F.; Kumar, R.; Lattanzi, S.; Mitzenmacher, M.; Panconesi, A.; Raghavan, P. On compressing social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, San Diego, CA, USA, August 15-18, 1999; ACM: New York, NY, USA, 2009; pp. 219-228.
17. Elias, P. Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 1975, 21, 194-203.
18. Elias, P. Efficient storage and retrieval by content and address of static files. J. ACM 1974, 21, 246-260.
19. Fano, R.M. Project MAC. Computer Structures Group Memorandum 61. On the number of bits required to implement an associative memory; Massachusetts Institute of Technology: Cambridge, MA, USA, 1971.
20. Lewis, J.; Neumann, U. Performance of java versus C++; Computer Graphics and Immersive Technology Lab, University of Southern California: Los Angeles, CA, USA, 2003.