Graph compression by BFS (Q1662490): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficient Compression of Web Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the succinct representation of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Clique partitions, graph compression and speeding-up algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Codes for the World Wide Web / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Speeding Up Algorithms on Compressed Web Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Universal codeword sets and representations of the integers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Storage and Retrieval by Content and Address of Static Files / rank | |||
Normal rank | |||
Revision as of 10:20, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph compression by BFS |
scientific article |
Statements
Graph compression by BFS (English)
0 references
20 August 2018
0 references
Summary: The \textit{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.
0 references
data compression
0 references
web graph
0 references
graph compression
0 references
breadth-first search
0 references
universal codes
0 references
