Henzinger MH, Fredman ML. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. 1998;22(3):351-362. doi:10.1007/pl00009228
LibreCat: https://research-explorer.ista.ac.at/record/11681
DOI: 10.1007/pl00009228