Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll

From Algorithm Wiki
(Redirected from TADM2E 9.11)
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=1185"