Fast and Compact Web Graph Representations

LZGraph

It is a compressed Web graph representation based on Lempel-Ziv compression algorithm.
This version uses differences and bitmaps for representing the pointers.
The source can be downloaded here. When compiled it generates three binary files:

compressor: reads in a graph in our input format (see Datasets) and creates a .lzg file, the compressed representation for the graph.

use: and interactive shell for consulting adjacency lists in the compressed
representation.

rebuild: takes the compressed graph and generates a file with the same prefix
adding .rebuilt to the name. This is the uncompressed representation of
the graph.

This representation does not support splitting yet. An example of use is given next: