A spectral algorithm for finding maximum cliques in dense random intersection graphs

Filippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulos +1

In a random intersection graph $G_{n,m,p}$, each of $n$ vertices selects a random subset of a set of $m$ labels by including each label independently with probability $p$ and edges…