Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information

Tianyi Chen, Atsushi Miyauchi, Charalampos E. Tsourakakis

Given a network $G=(V,E)$, where each node $v$ is associated with a vector ${\mathbf{p}}_v\in {\mathbb{R}}^d$ representing its opinion about $d$ different topics, how can we uncov…