Parallel-Graph-Colouring

Authors

This project was a collaboration for the course :

Design of Parallel and High-Performance Computing

from 2017 at ETH Zurich from the following members:

Margomenos Spyridon, Mösch Philippe, Denzler Alain

Loading a graph from a file

• download or generate the graph as an edge list (for example from the stanford network analytics database)
• run it through the sort graph file (takes a while but you only have to do it once)
• then you can use this sorted version as a command line argument