Develops the first sublinear-time fully dynamic data structures for spectral vertex sparsifiers with applications to dynamic Laplacian solvers and effective resistance queries.
For our overall bound on the number of steps that a random walk takes in the core component, we need the following bound on the expected number of steps of a walk within each ray
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fully Dynamic Spectral Vertex Sparsifiers and Applications
Develops the first sublinear-time fully dynamic data structures for spectral vertex sparsifiers with applications to dynamic Laplacian solvers and effective resistance queries.