Computing minimum vertex clique covers using data reduction.

Before you can start you need to install the following software packages:

• Scons (http://www.scons.org/)
• OpenMPI (http://www.open-mpi.de/)

After installing the packages, run scons program=vcc variant=optimized to build.

This package contains 5 different algorithms: Chalupa, Redu, ReduVCC, BnR, and EdgeBnR, which can be run as follows:

Chalupa ./optimized/vcc [--mis=<independent set size>] --run_type="Chalupa" <input graph>

Redu ./optimized/vcc --run_type="Redu" <input graph>

ReduVCC ./optimized/vcc [--mis=<independent set size>] --run_type="ReduVCC" <input graph>

BnR ./optimized/vcc --run_type="bnr" <input graph>

EdgeBnr ./optimized/vcc --preconfiguration=fsocial --k=2 --run_type="edge_bnr" <input graph>

--seed specifies the seed for the random number generator (default 0).

--solver_time_limit specifies the time limit in seconds (default 3600).

ReduVCC uses the unweighted METIS format, which consists of

<# vertices> <# edges> 0

followed by <# vertices> lines of space-separated vertices, where the i-th line consists of all neighbors of i. All vertices range from 1 to <# vertices>

Loops and directed edges are not supported.

You will find an example graph in the directory examples