Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation | IEEE Journals & Magazine | IEEE Xplore