a fast and provable method for estimating clique counts using turan ' s theorem .
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees