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.
dynaroars / npbench Goto Github PK
View Code? Open in Web Editor NEWa collection of benchmarks (in DIMACS format) for various NP-Complete problems
Home Page: https://unsat.github.io/npbench/