Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees