NP-Complete benchmark collections: a collection of benchmarks (in DIMACS format) for various NP-Complete problems including graph coloring, maximum clique, vertex cover, and spanning trees.
a collection of benchmarks (in DIMACS format) for various NP-Complete problems
NP-Complete benchmark collections: a collection of benchmarks (in DIMACS format) for various NP-Complete problems including graph coloring, maximum clique, vertex cover, and spanning trees.
a collection of benchmarks (in DIMACS format) for various NP-Complete problems
https://unsat.github.io/npbench/