Monika Rauch Henzinger, Michael L. Fredman. Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica, 22(3):351-362, 1998. [doi]
@article{HenzingerF98,
title = {Lower Bounds for Fully Dynamic Connectivity Problems in Graphs},
author = {Monika Rauch Henzinger and Michael L. Fredman},
year = {1998},
url = {http://link.springer.de/link/service/journals/00453/bibs/22n3p351.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/HenzingerF98},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {22},
number = {3},
pages = {351-362},
}