Demonstrates the key gadget for polytime reduction from the NP-complete CNF-SAT (conjunction normal form satisfiability) problem to the independent set problem, a graph problem. Created by <a href="//commons.wikimedia.org/wiki/User:Dcoetzee" title="User:Dcoetzee">Derrick Coetzee</a> in Adobe Illustrator. Intended to replace <a href="https://en.wikipedia.org/wiki/Image:CNF-SAT-independent-set-reduction.png" class="extiw" title="en:Image:CNF-SAT-independent-set-reduction.png">en:Image:CNF-SAT-independent-set-reduction.png</a>, which was derived from the same source file.
No machine-readable author provided. <a href="//commons.wikimedia.org/wiki/User:Dcoetzee" title="User:Dcoetzee">Dcoetzee</a> assumed (based on copyright claims).
No machine-readable source provided. Own work assumed (based on copyright claims).