On Fully Dynamic Graph Sparsifiers

@article{Abraham2016OnFD,
  title={On Fully Dynamic Graph Sparsifiers},
  author={Ittai Abraham and David Durfee and Ioannis Koutis and Sebastian Krinninger and Richard Peng},
  journal={2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2016},
  pages={335-344}
}
  • Ittai Abraham, David Durfee, +2 authors Richard Peng
  • Published in
    IEEE 57th Annual Symposium on…
    2016
  • Mathematics, Computer Science
  • We initiate the study of fast 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 ± ϵ)-spectral sparsifier with amortized update time poly(log n, ϵ<sup>-1</sup>). Second, we give a fully dynamic algorithm for maintaining a (1 ± ϵ)-cut sparsifier… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 42 CITATIONS

    Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections

    VIEW 10 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Dynamic low-stretch trees via dynamic low-diameter decompositions

    VIEW 4 EXCERPTS
    CITES BACKGROUND

    Fully dynamic spectral vertex sparsifiers and applications

    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS

    Communication-Optimal Distributed Dynamic Graph Clustering

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Maximizing the Number of Spanning Trees in a Connected Graph

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 59 REFERENCES

    Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

    • Yin Tat Lee, He Sun
    • Computer Science
    • 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
    • 2015