The algorithm runs in
Qzaac/densest_subgraph
Linear-time implementation of a greedy algorithm used to compute an approximation to the densest subgraph problem.
Python
Linear-time implementation of a greedy algorithm used to compute an approximation to the densest subgraph problem.
Python
The algorithm runs in