Graph Compression by BFS
College of Computing, Georgia Institute of Technology, 801 Atlantic Drive, Atlanta, GA 30332, USA
Dipartimento di Ingegneria dell’Informazione, Università di Padova, Via Gradenigo 6/A, I-35131 Padova, Italy
Dipartimento di Informatica e Automazione, Università di Roma Tre, Via della Vasca Navale 79, I-00146 Roma, Italy
Istituto di Analisi dei Sistemi ed Informatica (IASI), CNR, Viale Manzoni 30, I-00185 Roma, Italy
Author to whom correspondence should be addressed.
Received: 30 June 2009 / Revised: 20 August 2009 / Accepted: 21 August 2009 / Published: 25 August 2009
PDF [261 KB, uploaded 24 August 2009]
The 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.
This is an open access article distributed under the Creative Commons Attribution License
(CC BY 3.0).
Share & Cite This Article
MDPI and ACS Style
Apostolico, A.; Drovandi, G. Graph Compression by BFS. Algorithms 2009, 2, 1031-1044.
Apostolico A, Drovandi G. Graph Compression by BFS. Algorithms. 2009; 2(3):1031-1044.
Apostolico, Alberto; Drovandi, Guido. 2009. "Graph Compression by BFS." Algorithms 2, no. 3: 1031-1044.
Show more citation formats
Show less citations formats
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.