Difference between revisions of "Skskskskskskskskskkskskskskskskskkakqlqlqlqllqkqkqkqlqllqllalalaslalalslsllalalalalalslsllslslslslslslsll"

From Algorithm Wiki
Jump to: navigation, search
m (Replaced content with "H")
 
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

Latest revision as of 07:48, 15 April 2019

H