Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll

From Algorithm Wiki

Revision as of 07:47, 15 April 2019 by Trampin' all the way (talk | contribs) (Trampin' all the way moved page TADM2E 9.11 to Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to: navigation, search

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.

Retrieved from "https://algorist.com/algowiki_v2/index.php?title=Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll&oldid=663"