Develops the first sublinear-time fully dynamic data structures for spectral vertex sparsifiers with applications to dynamic Laplacian solvers and effective resistance queries.
Note that this rescaling by 1/ρ (∑ 1≤ i≤ ℓ 1 w wi− 1wi ) is quite natural: Consider the degenerate case where T = V
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.