Efficient Densest Subgraph Computation in Evolving Graphs

   Abstract