Fully dynamic biconnectivity in $\tilde{\mathcal{O}}({\log }^{2}n)$ time

Jacob Holm, Wojciech Nadara, Eva Rotenberg +1

We present a deterministic fully-dynamic data structure for maintaining information about the cut-vertices in a graph; i.e. the vertices whose removal would disconnect the graph. O…