Framework for finding the maximum independent set of large sparse graphs.
Main project site: http://algo2.iti.kit.edu/kamis/
Compile the source by running compile.sh. The binaries can then be found in the folder deploy. To compile the programs you need to have Argtable, g++, OpenMP and scons installed.
To convert a graph from DIMACS to METIS format or sort its edges you can use the python scripts in the misc folder.
redumis FILE [options].
This is a brief overview of the most important options. For a full description, please take a look at the user guide.
FILE
Path to graph file that you want the maximum independent set for.
-help
Print help.
-console_log
Write the log to the console.
-output=<string>
Path to store the resulting independent set.
-seed=<int>
Seed to use for the random number generator.
-config=<string>
Config to use for the evolutionary algorithm [standard|social].
-time_limit=<double>
Time limit until the algorithm terminates.