Difference between revisions of "Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll"
From Algorithm Wiki
(Recovering wiki) |
m (Trampin' all the way moved page TADM2E 9.11 to Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll) |
(No difference)
| |
Revision as of 07:47, 15 April 2019
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.
