Fully dynamic 2-edge connectivity algorithm in polygarithmic time per operation
| Author(s) : | Monika Rauch Henzinger Valerie King, |
| Publisher : | N/A |
| Publication Date : | 1997 |
| ISSN : | N/A |
| Abstract : | 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, |