Difference between revisions of "Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll"
From Algorithm Wiki
m (Replaced content with "H")
|Line 1:||Line 1:|
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.