Near-optimal fully dynamic densest subgraph
- Award ID(s):
- 1846218
- NSF-PAR ID:
- 10175445
- Date Published:
- Journal Name:
- Proccedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020}
- Page Range / eLocation ID:
- 181 to 193
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1145/3357713.3384327
