Constant approximating k-clique is w[1]-hard.

Published in: STOC (2021)

Keyphrases

independent set
learning algorithm
computer vision
three dimensional
similarity measure
learning environment
hidden markov models
maximum weight