Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time
STOC, pp. 1122-1129, 2017.
Dynamic spanning forestGraph decompositionSparse recoveryLocal graph partitioning
We present two algorithms for dynamically maintaining a spanning forest of a graph undergoing edge insertions and deletions. Our algorithms guarantee worst-case update time and work against an adaptive adversary, meaning that an edge update can depend on previous outputs of the algorithms. We provide the first polynomial improvement over ...More
Full Text (Upload PDF)
PPT (Upload PPT)