- freely available
Graph Compression by BFS
AbstractThe Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.
Share & Cite This Article
Apostolico, A.; Drovandi, G. Graph Compression by BFS. Algorithms 2009, 2, 1031-1044.View more citation formats
Apostolico A, Drovandi G. Graph Compression by BFS. Algorithms. 2009; 2(3):1031-1044.Chicago/Turabian Style
Apostolico, Alberto; Drovandi, Guido. 2009. "Graph Compression by BFS." Algorithms 2, no. 3: 1031-1044.
Notes: Multiple requests from the same IP address are counted as one view.