Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation

This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmic time per operation. The algorithm is a Las-Vegas type randomized algorithm. The expected time for p = (m0 + n) insertions or deletions of edges is O(p log n), where m0 is the number of edges in the initial graph with n nodes. The worst-case time for a query is O(log n). If only deletions are allowed then the cost for p updates is O(p log n) expected time.