activity
20122026
most citedModern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set

28 citations · 95 across the 14 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

cond-mat.dis-nn2018

Parallel Tempering for the planted clique problem

Maria Chiara Angelini

The theoretical information threshold for the planted clique problem is , however no polynomial algorithm is known to recover a planted clique of size , $…