In recent years, processing and analysing large graphs has become a major need in many research areas. Distributed graph processing programming models and frameworks arised as a natural solution to process linked data of large volumes, such as data originating from social media. These solutions are distributed by design and help developers to perform operations on the graph, sometimes reaching almost real-time performance even on huge graphs. Some of the available graph processing frameworks exploit generic data processing models, like MapReduce, while others were specifically built for graph processing, introducing techniques such as vertex or edge partitioning and graph-oriented programming models. In this work, we analyse the properties ...