Constant-Factor Local Approximation for Bipartite Densest Subgraph

Michael Kapralov, Jakub Łącki, Silvio Lattanzi +1

Given a vertex $v$ in a large bipartite graph $G$, can one quickly find a small densely connected region near $v$? This is the algorithmic core of many fraud detection, community d…