CC-MR - Finding Connected Components in Huge Graphs with MapReduce
On this page we offer supplementary material for our paper "Thomas Seidl, Brigitte Boden, Sergej Fries: CC-MR - Finding Connected Components in Huge Graphs with MapReduce, ECML PKDD 2012."
Here we provide the jar file for running the CC-MR algorithm: ConnectedComponentsBigComps.jar
As an example of how to run the algorithm, we provide a script in the following file:
In the following we provide the synthetic and real-world datasets used in our experiments. Short descriptions of the datasets can be found in the paper.
Sometimes the .zip archives had to be split into several parts.
For each of our experiments with synthetic data, the datasets are provided in one or two .zip archives.
Varying component diameter: Diameter.zip