Faster and Scalable Algorithms for Densest Subgraph and Decomposition

We study the densest subgraph problem (DSG) and the densest subgraph local decomposition problem (DSG-LD) in undirected graphs. We also consider su-permodular generalizations of these problems. For large scale graphs simple iterative algorithms perform much better in practice than theoretically fast algorithms based on network-flow or LP solvers. Boob et al. [ 1 ] recently gave a fast iterative algorithm called G