Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers

Cited by: 0|Bibtex|Views33|Links

Abstract:

We present a general framework of designing efficient dynamic approximate algorithms for optimization on undirected graphs. In particular, we develop a technique that, given any problem that admits a certain notion of vertex sparsifiers, gives data structures that maintain approximate solutions in sub-linear update and query time. We il...More

Code:

Data:

Your rating :
0

 

Tags
Comments