Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Monika Rauch Henzinger, Michael L. Fredman. Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica, 22(3):351-362, 1998. [doi]
No references recorded for this publication.
No citations of this publication recorded.