Difference between revisions of "Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll"

Revision as of 07:48, 15 April 2019

H

Revision as of 07:47, 15 April 2019 (view source) Trampin' all the way (talk \| contribs) m (Trampin' all the way moved page TADM2E 9.11 to Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll) ← Older edit		Revision as of 07:48, 15 April 2019 (view source) Trampin' all the way (talk \| contribs) m (Replaced content with "H") Newer edit →
Line 1:		Line 1:
−	~~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.~~	+	H