Yet another NP-Completeness practice problem. This time from Graph Theory.

If you are reviewing Theory of Computation, here is a nice and simple example of NP-Completeness proof.

© 2014-2019 Victor Farazdagi · Powered by the Academic theme for Hugo.