Algorithms 2009, 2(3), 1031-1044; doi:10.3390/a2031031
Article

Graph Compression by BFS

Alberto Apostolico 1,2 email and Guido Drovandi 3,4,* email
1 College of Computing, Georgia Institute of Technology, 801 Atlantic Drive, Atlanta, GA 30332, USA 2 Dipartimento di Ingegneria dell’Informazione, Università di Padova, Via Gradenigo 6/A, I-35131 Padova, Italy 3 Dipartimento di Informatica e Automazione, Università di Roma Tre, Via della Vasca Navale 79, I-00146 Roma, Italy 4 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; in revised form: 20 August 2009 / Accepted: 21 August 2009 / Published: 25 August 2009
(This article belongs to the Special Issue Data Compression)
PDF Full-text Download PDF Full-Text [261 KB, uploaded 24 August 2009 18:39 CEST]
Abstract: 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.
Keywords: data compression; web graph; graph compression; breadth first search; universal codes

Article Statistics

Click here to load and display the download statistics.

Cite This Article

MDPI and ACS Style

Apostolico, A.; Drovandi, G. Graph Compression by BFS. Algorithms 2009, 2, 1031-1044.

AMA Style

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.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert