A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Journal of the ACM
Deterministic fully dynamic graph algorithms are presented for connectivity, minimum spanning tree, 2-edge connectivity, and biconnectivity. Assuming that we start with no edges in a graph with n vertices, the amortized operation costs are O(log 2 n) for connectivity, O(log 4 n) for minimum spanning forest, 2-edge connectivity, and O(log 5 n) biconnectivity.doi:10.1145/502090.502095 fatcat:nytjliurxbenfeunk5tzhaakmi