Difference between revisions of "Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll"
From Algorithm Wiki
m (Trampin' all the way moved page TADM2E 9.11 to Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll) |
m (Reverted edits by Trampin' all the way (talk) to last revision by Algowikiadmin) |
| (One intermediate revision by one other user not shown) | |
(No difference)
| |
Latest revision as of 04:07, 7 August 2020
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.
