2022
Faster and Scalable Algorithms for Densest Subgraph and Decomposition
NeurIPS 2022accept
We study the densest subgraph problem (DSG) and the densest subgraph local decomposition problem (DSG-LD) in undirected graphs. We also consider supermodular generalizations of these problems. For large scale graphs simple iterative algorithms perform much better in practice than theoretically fast…