Optimal Offline Dynamic $2,3$-Edge/Vertex Connectivity

Cited by: 0|Bibtex|Views6|Links

Abstract:

We give offline algorithms for processing a sequence of $2$ and $3$ edge and vertex connectivity queries in a fully-dynamic undirected graph. While the current best fully-dynamic online data structures for $3$-edge and $3$-vertex connectivity require $O(n^{2/3})$ and $O(n)$ time per update, respectively, our per-operation cost is only $...More

Code:

Data:

Your rating :
0

 

Tags
Comments