Near-optimal fully dynamic densest subgraph.

Saurabh Sawlani Junxing Wang

Published in: STOC (2020)

Keyphrases

graph mining
dynamic environments
case study
real time
real world
clustering algorithm
lower bound
np hard
dense subgraphs