Flowless: Extracting Densest Subgraphs Without Flow Computations
WWW '20: The Web Conference 2020 Taipei Taiwan April, 2020, pp. 573-583, 2019.
The problem of finding dense components of a graph is a major primitive in graph mining and data analysis. The densest subgraph problem (DSP) that asks to find a subgraph with maximum average degree forms a basic primitive in dense subgraph discovery with applications ranging from community detection to unsupervised discovery of biologica...More
PPT (Upload PPT)