A heuristic approach for Minimum Dominating Set which is an NP-Complete problem and analysis of speed performance and correctness.
-
Updated
Feb 21, 2021 - C++
A heuristic approach for Minimum Dominating Set which is an NP-Complete problem and analysis of speed performance and correctness.
Add a description, image, and links to the heuristic-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the heuristic-algorithms topic, visit your repo's landing page and select "manage topics."