a collection of benchmarks (in DIMACS format) for various NP-Complete problems
-
Updated
Dec 19, 2022 - TeX
#
np-complete
Here are 6 public repositories matching this topic...
This class will create the knapsack, the items, and implement the three strategies to it to find their different execution times.
java text greedy np-complete brute-force dynamic-programming greedy-algorithms knapsack-problem knapsack
-
Updated
Mar 5, 2017 - TeX
LaTeX source for my presentation of Hans Bodlaender's "Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth"
-
Updated
Jul 1, 2018 - TeX
📝 Solutions to the exercise sessions
computer-science logic mathematics np-complete ulb exercise-sessions computational-complexity decidability
-
Updated
Dec 5, 2018 - TeX
NP-Completeness prove for Hamiltonian Circuit problem
-
Updated
Jan 9, 2019 - TeX
Improve this page
Add a description, image, and links to the np-complete topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the np-complete topic, visit your repo's landing page and select "manage topics."