Henzinger, M. H., &; Fredman, M. L. (1998). Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. Springer Nature.https://doi.org/10.1007/pl00009228 
LibreCat: https://research-explorer.ista.ac.at/record/11681
DOI: 10.1007/pl00009228