Abstract: We present randomized algorithms with a total update time of Õ(m √n) for the problems of decremental single source reachability and decremental strongly connected components on directed ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results