Multi-Gi.L.A.

Multi-Gi.L.A. is a multi-level distributed layout drawing algorithm implemented in Giraph.

This is a support website for the paper submitted to IEEE Transactions on Parallel and Distributed Systems. You can download the graphs used in the experimentation and you can find a link to the source code hosted on GitHub.

Requirements

  • Java 1.7
  • Maven (needed to compile the code)
  • A Hadoop cluster running Hadoop 2.6.0

Go to next page to find out how to use the software.

Code

Follow the link to connect to the GitHub repository of MultiGila. Two branches are available: release, that represents the version of Multi-Gila published at GD 2016, and SpanningTree that represents the submitted, improved version of the algorithm.

Downloads

The following archives contain the test graphs used in the paper and the startup scripts.
The graphs are undirected and encoded in JSON format: [id,x,y,[(neighbor_id,)*]]

Real Graphs

5 real world graph with sizes up to 1,5M edges.

Big Graphs

6 graphs with sizes up to 24M edges.

Startup Scripts

The startup scripts and instructions to use MultiGila.

Authors

  • Alessio Arleo

  • Walter Didimo

  • Giuseppe Liotta

  • Fabrizio Montecchiani