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

Richard Peng, Bryce Sandlund, Daniel D. Sleator

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 o…