Compressing a directed massive graph using small world model

In this article we propose a method that can compress a small-world-like massive digraph (directed graph) into at most half size of the original representation represented by using adjacency list. This method also provides a fast decompression algorithm that works as quickly as adjacency list does. In this paper we deal with the problem of finding a compact representation of a graph from which the vertices adjacent to any specified vertex can be easily determined.