Report copyright - - Random Graphs and Complex Networks T-79people.seas.harvard.edu/~babis/T797003/Lectures/sL11.pdf · The greedy algorithm achieves a 2-approximation for the densest subgraph problem
Please pass captcha verification before submit form