Difference between revisions of "Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll"
From Algorithm Wiki
(Recovering wiki) |
(No difference)
|
Revision as of 18:13, 11 September 2014
add an independent set of size k to the graph, namely k vertices that aren't connected to each vertex. now run our algorithm and we would be able to solve clique.