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.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
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.