Simulator for Top-k Densest subgraphs and implementation for various algorithms for densest subgraph Different algorithm for finding the densest subgraph in a graph.
-------------Densest Subgraph Simulator----------------
Algorithm SimulatorType Approx-Guarantees k
KCore 0 2 1
Charikar 1 2 1
Bahmani 2 2(1+epsilon) 1
Dynamic K core 3 2 1
Epasto Fully Dynamic 4 2(1+epsilon)^6 1
Top-k KCore 5 2 k
Top-k Charikar 6 2 k
Top-k Bahmani 7 2(1+epsilon) k
Top-k KCore Evolving 8 2 k
Epasto Top-k 9 2(1+epsilon)^6 k
Greedy Algorithm 10 2 k
Top-k KCore Evolving 11 2 k
-------------Densest Subgraph Simulator----------------