English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

On Fully Dynamic Graph Sparsifiers

MPS-Authors
/persons/resource/persons199379

Krinninger,  Sebastian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)

1604.02094.pdf
(Preprint), 1019KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Abraham, I., Durfee, D., Koutis, I., Krinninger, S., & Peng, R. (2016). On Fully Dynamic Graph Sparsifiers. Retrieved from http://arxiv.org/abs/1604.02094.


Cite as: http://hdl.handle.net/11858/00-001M-0000-002C-510E-1
Abstract
We initiate the study of dynamic algorithms for graph sparsification problems and obtain fully dynamic algorithms, allowing both edge insertions and edge deletions, that take polylogarithmic time after each update in the graph. Our three main results are as follows. First, we give a fully dynamic algorithm for maintaining a $ (1 \pm \epsilon) $-spectral sparsifier with amortized update time $poly(\log{n}, \epsilon^{-1})$. Second, we give a fully dynamic algorithm for maintaining a $ (1 \pm \epsilon) $-cut sparsifier with \emph{worst-case} update time $poly(\log{n}, \epsilon^{-1})$. Both sparsifiers have size $ n \cdot poly(\log{n}, \epsilon^{-1})$. Third, we apply our dynamic sparsifier algorithm to obtain a fully dynamic algorithm for maintaining a $(1 + \epsilon)$-approximation to the value of the maximum flow in an unweighted, undirected, bipartite graph with amortized update time $poly(\log{n}, \epsilon^{-1})$.