Fully dynamic spectral vertex sparsifiers and applications
David Durfee, Yu Feng Gao, Gramoz Goranci, Richard Peng · 2019
We study dynamic algorithms for maintaining spectral vertex sparsifiers of graphs with respect to a set of terminals T of our choice. Such objects preserve pairwise resistances, solutions to systems of linear equations, and energy of electrical flows between the terminals in T. We give a data structure that supports insertions and deletions of edges, and terminal additions, all in sublinear time. We then show the applicability of our result to the following problems.