32 citations · 63 across the 6 of their papers we have counts for
1 paper · 1 filter
Zhengyu Wang
We present a randomized algorithm for dynamic graph connectivity. With failure probability less than 1/nc (for any constant c we choose), our solution has worst case running t…