M. H. Henzinger and M. L. Fredman, “Lower bounds for fully dynamic connectivity problems in graphs,” Algorithmica, vol. 22, no. 3. Springer Nature, pp. 351–362, 1998.