Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
arXiv:2511.20376v2 Announce Type: replace Abstract: We study efficient algorithms for recovering cliques in dense random intersection graphs (RIGs). In this model, $d = n^{\Omega(1)}$ cliques...