Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries

Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura +1

In the densest subgraph problem, given a weighted undirected graph $G(V,E,w)$, with non-negative edge weights, we are asked to find a subset of nodes $S\subseteq V$ that maximizes…