Qzaac / densest_subgraph

Linear-time implementation of a greedy algorithm used to compute an approximation to the densest subgraph problem.

The algorithm runs in $\mathcal{O}(N+M)$ where $N$ and $M$ are respectively the number of nodes and edges of a given graph. Extensive details on the implementation can be found here, along with empirical runtimes with graphs from http://snap.stanford.edu/data/index.html.