Poly-logarithmic deterministic fully-dynamic graph algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
Jacob Holm,
Kristian de Lichtenberg,
and Mikkel Thorup
J. ACM 48(4):723–760, Jul 2001
Proc. 30th Symp. Theory of Computing, ACM, May 1998, pp. 79–89
Cites:
