An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
-
Updated
May 18, 2018 - C++
An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
Simple implementation and parallelization of the DPLL algorithm for the satisfiability problem.
Add a description, image, and links to the 3-colorability-problem topic page so that developers can more easily learn about it.
To associate your repository with the 3-colorability-problem topic, visit your repo's landing page and select "manage topics."