Next Article in Journal
Radial Basis Function Cascade Correlation Networks
Next Article in Special Issue
Approximate String Matching with Compressed Indexes
Previous Article in Journal
Automated Modelling of Evolving Discontinuities
Algorithms 2009, 2(3), 1031-1044; doi:10.3390/a2031031

Graph Compression by BFS

 and 3,4,*
Received: 30 June 2009 / Revised: 20 August 2009 / Accepted: 21 August 2009 / Published: 25 August 2009
(This article belongs to the Special Issue Data Compression)
Download PDF [261 KB, uploaded 24 August 2009]
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 data compression; web graph; graph compression; breadth first search; universal codes
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |

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