Compact representation of Web graphs with extended functionality ?
We present k2-tree, a compact representation of Web graphs. It obtains the smallest space of the state of the art, supporting random navigation. It exploits the sparseness and clustering of the adjacency matrices of Web graphs. It supports successors and predecessors, and also single-link and range queries.
web graphs compact data structures