Flowless: Extracting Densest Subgraphs Without Flow Computations

Boob Digvijay
Boob Digvijay
Gao Yu
Gao Yu
Wang Di
Wang Di
Wang Junxing
Wang Junxing

WWW '20: The Web Conference 2020 Taipei Taiwan April, 2020, pp. 573-583, 2019.

Cited by: 1|Bibtex|Views19|Links
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments