Near-optimal fully dynamic densest subgraph

DOI10.1145/3357713.3384327OpenAlexW3035455649MaRDI QIDQ5144907

Junxing Wang, Saurabh Sawlani

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.03037

zbMATH Keywords

data structuresgraph orientationfully dynamic algorithmdense subgraph discoverylinear programming dual

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Improved dynamic colouring of sparse graphs

This page was built for publication: Near-optimal fully dynamic densest subgraph