Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Bernstein Aaron
Bernstein Aaron
Brand Jan van den
Brand Jan van den
Gutenberg Maximilian Probst
Gutenberg Maximilian Probst
Sun He
Sun He
Cited by: 0|Bibtex|Views22|Links

Abstract:

Designing dynamic graph algorithms against an adaptive adversary is a major goal in the field of dynamic graph algorithms. While a few such algorithms are known for spanning trees, matchings, and single-source shortest paths, very little was known for an important primitive like graph sparsifiers. The challenge is how to approximately p...More

Code:

Data:

Your rating :
0

 

Tags
Comments