LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.
-
Updated
Jun 14, 2022 - C++
#
minimal-vertex-cover
Here are 4 public repositories matching this topic...
This program solves the 5x5x5 brick-cube-puzzle in less than one second by transforming it to a minimal-vertex-cover problem.
-
Updated
Dec 12, 2020 - C++
Algorithms design projects in 3 term
genetic-algorithm a-star alpha-beta-pruning btree minimax-algorithm graph-coloring metaheuristics artificial-bee-colony minimal-vertex-cover n-queens-problem iterative-depth-search obstruction-game
-
Updated
Feb 19, 2022 - C++
Improve this page
Add a description, image, and links to the minimal-vertex-cover topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the minimal-vertex-cover topic, visit your repo's landing page and select "manage topics."