Skip to content
Peaty: an exact solver for the vertex cover problem
C++ TeX Other
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
description
sample-instances
simple-colourer
.gitignore
CMakeLists.txt
LICENSE.txt
README.md
bitset.h
colourer.cpp
colourer.h
fast_int_queue.h
graph.cpp
graph.h
graph_colour_solver.cpp
graph_colour_solver.h
int_stack_without_dups.h
make-pace-challenge-versions
params.h
root_node_processing.cpp
root_node_processing.h
sequential_solver.cpp
sequential_solver.h
solve_mwc.cpp
sparse_graph.cpp
sparse_graph.h
util.cpp
util.h

README.md

Peaty is an exact solver for the vertex cover problem, which was written as an entry to the 2019 PACE challenge.

To compile:

mkdir build
cd build
cmake ..
make

To run:

./build/solve_vc < instance.hgr
You can’t perform that action at this time.